Java Math Exercises: Count the absolute distinct value in an array

Java Math Exercises: Exercise-5 with Solution

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)) {

Sample Output:



Flowchart: Count the absolute distinct value in an array.

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.

What is the difficulty level of this exercise?

Java: Tips of the Day

How to convert comma-separated String to List?

Convert comma separated String to List:

List<String> items = Arrays.asList(str.split("\\s*,\\s*"));

The above code splits the string on a delimiter defined as: zero or more whitespace, a literal comma, zero or more whitespace which will place the words into the list and collapse any whitespace between the words and commas.

Please note that this returns simply a wrapper on an array: you CANNOT for example .remove() from the resulting List. For an actual ArrayList you must further use new ArrayList<String>.

Ref: https://bit.ly/30L0FLH