Question

How to sum all distinct (non-repeating) elements in a given array with Java

Answer 1

import java.util.Set; 
import java.util.Arrays; 
import java.util.HashSet; 
 
public class MyClass {
     public static int sumDistinctElements(Integer[] arr) {
        Set<Integer> set = new HashSet(Arrays.asList(arr));
   
        int sum = 0;
        for (Integer n : set) {
            sum += n;
        }
         
        return sum;
    }
    public static void main(String args[]) {
        Integer arr[] = {5, 2, 1, 3, 7, 1, 5, 9, 3, 3, 3, 2, 2};
   
        System.out.println(sumDistinctElements(arr)); // 5 + 2 + 1 + 3 + 7 + 9
    }
}
   
   
   
   
/*
run:
   
27
   
*/

 

70+ SQL courses for beginners and professionals

Answer 2

import java.util.HashSet;
  
public class MyClass {
    public static int sumDistinctElements(int [] arr) {
        HashSet<Integer> hashSet = new HashSet<>();
        int sum = 0;
        for (int i = 0; i < arr.length ; i++) {
            if (!hashSet.contains(arr[i])){
                sum += arr[i];
                hashSet.add(arr[i]);
            }
        }
         
        return sum;
    }
    public static void main(String args[]) {
        int [] arr = {1, 4, 8, 8, 8, 1, 1, 1, 1, 7, 9 ,9, 5, 3};
        
        System.out.print(sumDistinctElements(arr)); // 1 + 4 + 8 + 7 + 9 + 5 + 3 
     }
}
  
  
  
     
/*
run:
            
37
            
*/

 

70+ SQL courses for beginners and professionals