Hackerrank - Pairs - Pavol Pidanič

Popis problému
Celý popis zadania sa nacháza – Hackerrank.

Riešenie
Usporiadaj zadané pole. Vyber postupne 1 element a skontroluj postupne všetky nasledujúce prvky, či je ich rodiel rovný k. Ak je už rozdiel väčší, vyber nasledujúci.

Poznámka: Riešenie pre JavaScript a Ruby používajú rovnaký algoritmus, ale niektoré testy skončili timeout-om.

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

Java
JavaScript
Ruby
Scala

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

Java

import java.util.Arrays;
import java.util.Scanner;

public class Pairs 
{
    public static void main(String[] args)
    {
         Scanner in = new Scanner(System.in);
         int n = in.nextInt();
         int k = in.nextInt();
         int[] ar = new int[n];
         for(int i = 0; i < n; i++){
             ar[i] = in.nextInt(); 
         }
         Arrays.sort(ar);
         
         int pairs = 0;
         for(int i = 0; i < ar.length; i++)
         {
             for(int j = i + 1; j < ar.length; j++)
             {
                 if(ar[j] - ar[i] == k)
                 {
                     pairs++;
                     break;
                 }
             }
         }
         System.out.println(pairs);
         in.close();
    }
}

import java.util.Arrays;

import java.util.Scanner;

public class Pairs

{

public static void main(String[] args)

{

Scanner in = new Scanner(System.in);

int n = in.nextInt();

int k = in.nextInt();

int[] ar = new int[n];

for(int i = 0; i < n; i++){

ar[i] = in.nextInt();

}

Arrays.sort(ar);

int pairs = 0;

for(int i = 0; i < ar.length; i++)

{

for(int j = i + 1; j < ar.length; j++)

{

if(ar[j] - ar[i] == k)

{

pairs++;

break;

}

System.out.println(pairs);

in.close();

}

JavaScript

'use strict';

const processData = input => {
    let lines = input.split('\n');
    let definition = lines[0].split(' ').map(i => parseInt(i));
    let difference = definition[1];
    let array = lines[1].split(' ').map(i => parseInt(i));
    let sortedArray = array.sort((a, b) => a - b);
    let pairs = 0;
    for(let i = 0; i < sortedArray.length - 1; i++) {
        for(let j = i + 1; j < sortedArray.length; j++) {
            if(sortedArray[j] - sortedArray[i] == difference) {
                pairs++;
            }
        }
    }
    console.log(pairs);
};

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

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

'use strict';

const processData = input => {

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

let definition = lines[0].split(' ').map(i => parseInt(i));

let difference = definition[1];

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

let sortedArray = array.sort((a, b) => a - b);

let pairs = 0;

for(let i = 0; i < sortedArray.length - 1; i++) {

for(let j = i + 1; j < sortedArray.length; j++) {

if(sortedArray[j] - sortedArray[i] == difference) {

pairs++;

}

console.log(pairs);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Ruby

(length, diff) = gets.split.map{|s| s.to_i}
arr = gets.split.map{|s| s.to_i}.sort{|a,b| a <=> b}
pairs = 0
for i in 0...arr.size - 1
  for j in (i+1)...arr.size
    if(arr[j] - arr[i] == diff)
      pairs += 1
      break
    end
  end
end
puts pairs

(length, diff) = gets.split.map{|s| s.to_i}

arr = gets.split.map{|s| s.to_i}.sort{|a,b| a <=> b}

pairs = 0

for i in 0...arr.size - 1

for j in (i+1)...arr.size

if(arr[j] - arr[i] == diff)

pairs += 1

break

end

puts pairs

Scala

import scala.io.Source
import scala.util.control.Breaks._

object Pairs extends App {
  val lines = Source.stdin.getLines().toList
  val definition = lines(0).split(" ").map(_.toInt)
  val diff = definition(1)
  val array = lines(1).split(" ").map(_.toInt).sorted
  var pairs = 0
  (0 until array.length - 1).foreach(i => {
    breakable {
      (i + 1 until array.length).foreach(j => {
        if (array(j) - array(i) == diff) {
          pairs += 1
          break
        }
      })
    }
  })

  println(pairs)
}

import scala.io.Source

import scala.util.control.Breaks._

object Pairs extends App {

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

val definition = lines(0).split(" ").map(_.toInt)

val diff = definition(1)

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

var pairs = 0

(0 until array.length - 1).foreach(i => {

breakable {

(i + 1 until array.length).foreach(j => {

if (array(j) - array(i) == diff) {

pairs += 1

break

}

})

}

})

println(pairs)

}

Pavol Pidanič

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

Hackerrank – Pairs