Hackerrank - Beautiful Triplets

Hackerrank – Popis problému

Celý popis zadania sa nacháza – Hackerrank.

Riešenie

Skontroloval som, či vyhovuje podmienka pre každú kombináciu prvkov (i, j, k).
Je potrebné si dať pozor a v určitých prípadoch ukončiť skôr iterácie nad prvkami. A to vtedy keď array[j] - array[i] <= d or array[k] - array[j] <= d

Vytvoril som riešenie v týchto programovacích jazykoch:

Scala
Java
JavaScript
Ruby

Všetky riešenia sú dostupné aj na mojom GitHub profile.

Java

object BeautifulTriplets extends App {
  val lines = Source.stdin.getLines().toList
  val d = lines(0).split(" ").map(_.toInt).toList(1)
  val array = lines(1).split(" ").map(_.toInt)

  val indices = array.indices
  var beautifulTriplets = 0
  for(i <- (0 until indices.length - 2)) {
    for (j <- ((i + 1) until indices.length - 1) if (array(j) - array(i) <= d)) {
      for (k <- ((j + 1) until indices.length) if (array(k) - array(j) <= d)) {
        if (((array(j) - array(i)) == d) && ((array(k) - array(j)) == d)) {
          beautifulTriplets += 1
        }
      }
    }
  }
  println(beautifulTriplets)
}

object BeautifulTriplets extends App {

val lines = Source.stdin.getLines().toList

val d = lines(0).split(" ").map(_.toInt).toList(1)

val array = lines(1).split(" ").map(_.toInt)

val indices = array.indices

var beautifulTriplets = 0

for(i <- (0 until indices.length - 2)) {

for (j <- ((i + 1) until indices.length - 1) if (array(j) - array(i) <= d)) {

for (k <- ((j + 1) until indices.length) if (array(k) - array(j) <= d)) {

if (((array(j) - array(i)) == d) && ((array(k) - array(j)) == d)) {

beautifulTriplets += 1

}

println(beautifulTriplets)

}

JavaScript

'use strict';

const processData = input => {
    const lines = input.split('\n');
    const [n, d] = lines[0].split(' ').map(i => parseInt(i));
    const array = lines[1].split(' ').map(i => parseInt(i));

    let triplets = 0;
    for(let i = 0; i < n - 2; i++) {
        for(let j = i + 1; j < n - 1; j++) {
            if(array[j] - array[i] > d) break;
            for(let k = j + 1; k < n; k++) {
                if(array[k] - array[j] > d) break;
                if((array[k] - array[j] == d) && (array[j] - array[i] == d)) {
                    triplets++;
                }
            }
        }
    }
    console.log(triplets);
};

process.stdin.resume();
process.stdin.setEncoding("ascii");

let _input = "";
process.stdin.on("data", input => _input += input);
process.stdin.on("end", () => processData(_input));

'use strict';

const processData = input => {

const lines = input.split('\n');

const [n, d] = lines[0].split(' ').map(i => parseInt(i));

const array = lines[1].split(' ').map(i => parseInt(i));

let triplets = 0;

for(let i = 0; i < n - 2; i++) {

for(let j = i + 1; j < n - 1; j++) {

if(array[j] - array[i] > d) break;

for(let k = j + 1; k < n; k++) {

if(array[k] - array[j] > d) break;

if((array[k] - array[j] == d) && (array[j] - array[i] == d)) {

triplets++;

}

console.log(triplets);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

process.stdin.on("data", input => _input += input);

process.stdin.on("end", () => processData(_input));

Scala

object BeautifulTriplets extends App {
  val lines = Source.stdin.getLines().toList
  val d = lines(0).split(" ").map(_.toInt).toList(1)
  val array = lines(1).split(" ").map(_.toInt)

  val indices = array.indices
  var beautifulTriplets = 0
  for(i <- (0 until indices.length - 2)) {
    for (j <- ((i + 1) until indices.length - 1) if (array(j) - array(i) <= d)) {
      for (k <- ((j + 1) until indices.length) if (array(k) - array(j) <= d)) {
        if (((array(j) - array(i)) == d) && ((array(k) - array(j)) == d)) {
          beautifulTriplets += 1
        }
      }
    }
  }
  println(beautifulTriplets)
}

object BeautifulTriplets extends App {

val lines = Source.stdin.getLines().toList

val d = lines(0).split(" ").map(_.toInt).toList(1)

val array = lines(1).split(" ").map(_.toInt)

val indices = array.indices

var beautifulTriplets = 0

for(i <- (0 until indices.length - 2)) {

for (j <- ((i + 1) until indices.length - 1) if (array(j) - array(i) <= d)) {

for (k <- ((j + 1) until indices.length) if (array(k) - array(j) <= d)) {

if (((array(j) - array(i)) == d) && ((array(k) - array(j)) == d)) {

beautifulTriplets += 1

}

println(beautifulTriplets)

}

Ruby

(n, d) = gets.strip.split(" ").map {|i| i.to_i}
array = gets.strip.split(" ").map {|i| i.to_i}

triplets = 0
for i in 0...(n-2)
  for j in (i+1)...(n-1)
    break if (array[j] - array[i] > d)
    for k in (j+1)...(n)
      break if (array[k] - array[j] > d)
      triplets += 1 if((array[k] - array[j] == d) && (array[j] - array[i] == d))
    end
  end
end

puts triplets

(n, d) = gets.strip.split(" ").map {|i| i.to_i}

array = gets.strip.split(" ").map {|i| i.to_i}

triplets = 0

for i in 0...(n-2)

for j in (i+1)...(n-1)

break if (array[j] - array[i] > d)

for k in (j+1)...(n)

break if (array[k] - array[j] > d)

triplets += 1 if((array[k] - array[j] == d) && (array[j] - array[i] == d))

end

puts triplets

Pavol Pidanič

Dokážem na 10 prstoch napočítať do 1023

Hackerrank – Beautiful Triplets