Leetcode 2021.3.15

src/main/java/com/examplehub/leetcode/easy/SumOfUniqueElements.java

@@ -0,0 +1,21 @@
+package com.examplehub.leetcode.easy;
+
+/** https://leetcode.com/problems/sum-of-unique-elements/ */
+public class SumOfUniqueElements {
+ public static int solution1(int[] nums) {
+ int sum = 0;
+ for (int i = 0; i < nums.length; ++i) {
+ boolean isUnique = true;
+ for (int j = 0; j < nums.length; ++j) {
+ if (i != j && nums[i] == nums[j]) {
+ isUnique = false;
+ break;
+ }
+ }
+ if (isUnique) {
+ sum += nums[i];
+ }
+ }
+ return sum;
+ }
+}

src/test/java/com/examplehub/leetcode/easy/SumOfUniqueElementsTest.java

@@ -0,0 +1,19 @@
+package com.examplehub.leetcode.easy;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.api.Test;
+
+class SumOfUniqueElementsTest {
+ @Test
+ void testSolution1() {
+ int[] nums = {1, 2, 3, 2};
+ assertEquals(4, SumOfUniqueElements.solution1(nums));
+
+ nums = new int[] {1, 1, 1, 1, 1};
+ assertEquals(0, SumOfUniqueElements.solution1(nums));
+
+ nums = new int[] {1, 2, 3, 4, 5};
+ assertEquals(15, SumOfUniqueElements.solution1(nums));
+ }
+}