We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Search
  4. Pairs
  5. Discussions

Pairs

  • krokiet
     + 0 comments

    Nice and easy this time! First time I post a solution here, because I'm stunned it worked at the very first time, wihtout any corrections (rare case;)

    Sort + caterpillar method.

    Java solution:

        public static int pairs(int k, List<Integer> arr) {
        Collections.sort(arr);
        int a = 0;
        int b = 1;
        int count = 0;
        while (a < b && b < arr.size()) {            
            int left = arr.get(a);
            int right = arr.get(b);
            int diff = right - left;
            if (diff == k) {
                count++;
                b++;
            } else if (diff > k) {
                a++;
                if (a==b) b++;
            } else {
                b++;
            }            
        }
				}
        return count;
    }