Leetcode 2021.3.15 (examplehub#74)

realDuYuanChao · github-actions · web-flow · commit 3e161368807f · 2021-03-15T09:22:49.000+08:00
* sum-of-unique-elements

* Formatted with Google Java Formatter

Co-authored-by: github-actions &lt;${GITHUB_ACTOR}@users.noreply.github.com&gt;
diff --git a/src/main/java/com/examplehub/leetcode/easy/SumOfUniqueElements.java b/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;
+  }
+}
diff --git a/src/test/java/com/examplehub/leetcode/easy/SumOfUniqueElementsTest.java b/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));
+  }
+}
