Compute number of distinct absolute values of sorted array elements.
- Difficulty Level: Easy
- Question URL: https://app.codility.com/programmers/lessons/15-caterpillar_method/abs_distinct/
- Time Complexity:
Solution:
Solution to Codility's Absolute Distinct problem which is from the Codility Lesson 15: Caterpillar method and, is solved in Java 8 with 100% performance and correctness scores. The goal here is to compute number of distinct absolute values of sorted array elements. You can find the question of this AbsDistinct problem in the Codility website.
package Codility.Lesson15;
import java.util.*;
public class AbsDistinct {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a1 = { -5, -3, -1, 0, 3, 6 };
int result2 = solution(a1);
System.out.println(result2);
}
public static int solution(int[] A) {
Set setA = new HashSet();
for (int i = 0; i < A.length; i++) {
setA.add(Math.abs(A[i]));
}
return setA.size();
}
}