Java: Count the absolute distinct value in an array

Last update on March 11 2025 11:06:08 (UTC/GMT +8 hours)

Count Absolute Distinct Values in Array

Write a Java program to count the absolute distinct value in an array.

Sample Solution:

Java Code:

import java.util.*;
import java.math.*;
public class Example5 {
 public static void main(String[] args) {
  {
   int[] numbers = new int[] {
    -1, -1, 0, 2, 2, 3, 0, 1, 5, 9
   };
   int count = 0;
   HashSet < Integer > set = new HashSet < Integer > ();

   for (int i = 0; i < numbers.length; i++) {
    int n = Math.abs(numbers[i]);
    if (!set.contains(n)) {
     set.add(n);
     count++;
    }
   }
   System.out.println(count);
  }
 }
}

Sample Output:

6

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to count distinct absolute values in an unsorted array using recursion.
• Write a Java program to sort an array by absolute value and then count distinct entries without extra data structures.
• Write a Java program to compute distinct absolute values using Java streams and collectors.
• Write a Java program to count distinct absolute values by converting numbers to their absolute equivalents and using a HashSet.

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a Java program to round a float number to specified decimals.
Next: Write a Java program to reverse an integer number.