Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,914 questions

51,847 answers

573 users

How to sum all the numbers in an array (the duplicate numbers sum only once) with Java

1 Answer

0 votes
import java.util.HashSet;

public class Program {
    public static int sumUniqueNumbers(int[] arr) {
        int result = 0;
        HashSet<Integer> uniqueNumbers = new HashSet<>();

        for (int num : arr) {
            if (!uniqueNumbers.contains(num)) {
                uniqueNumbers.add(num);
                result += num;
            }
        }

        return result;
    }

    public static void main(String[] args) {
        int[] arr = {2, 3, 4, 2, 1, 1, 7, 5, 8, 9, 5, 3};
        
        // 2 + 3 + 4 + 1 + 7 + 5 + 8 + 9 = 39
        
        System.out.println(sumUniqueNumbers(arr));
    }
}


 
/*
run
 
39
 
*/


 



answered May 31, 2024 by avibootz

Related questions

1 answer 87 views
1 answer 164 views
1 answer 75 views
1 answer 76 views
1 answer 90 views
...