feat: update solution to lc problem: No.3394

yanglbme · web-flow · commit 715e4a62f2b3 · 2025-04-08T06:09:21.000+08:00
diff --git a/solution/3300-3399/3396.Minimum Number of Operations to Make Elements in Array Distinct/README.md b/solution/3300-3399/3396.Minimum Number of Operations to Make Elements in Array Distinct/README.md
@@ -122,10 +122,9 @@ class Solution {
     public int minimumOperations(int[] nums) {
         Set<Integer> s = new HashSet<>();
         for (int i = nums.length - 1; i >= 0; --i) {
-            if (s.contains(nums[i])) {
+            if (!s.add(nums[i])) {
                 return i / 3 + 1;
             }
-            s.add(nums[i]);
         }
         return 0;
     }

Original file line number	Diff line number	Diff line change
`@@ -122,10 +122,9 @@ class Solution {`
`122`	`122`	`public int minimumOperations(int[] nums) {`
`123`	`123`	`Set<Integer> s = new HashSet<>();`
`124`	`124`	`for (int i = nums.length - 1; i >= 0; --i) {`
`125`		`- if (s.contains(nums[i])) {`
	`125`	`+ if (!s.add(nums[i])) {`
`126`	`126`	`return i / 3 + 1;`
`127`	`127`	`}`
`128`		`- s.add(nums[i]);`
`129`	`128`	`}`
`130`	`129`	`return 0;`
`131`	`130`	`}`