fix: update code

Author: yanglbme

solution/2100-2199/2170.Minimum Operations to Make the Array Alternating/README.md

@@ -124,7 +124,7 @@ class Solution {
         int k1 = 0, k2 = 0;
         Map<Integer, Integer> cnt = new HashMap<>();
         for (; i < nums.length; i += 2) {
-           cnt.merge(nums[i], 1, Integer::sum);
+            cnt.merge(nums[i], 1, Integer::sum);
         }
         for (var e : cnt.entrySet()) {
             int k = e.getKey(), v = e.getValue();

solution/2100-2199/2170.Minimum Operations to Make the Array Alternating/README_EN.md

@@ -123,7 +123,7 @@ class Solution {
         int k1 = 0, k2 = 0;
         Map<Integer, Integer> cnt = new HashMap<>();
         for (; i < nums.length; i += 2) {
-           cnt.merge(nums[i], 1, Integer::sum);
+            cnt.merge(nums[i], 1, Integer::sum);
         }
         for (var e : cnt.entrySet()) {
             int k = e.getKey(), v = e.getValue();

solution/2100-2199/2170.Minimum Operations to Make the Array Alternating/Solution.java

@@ -13,7 +13,7 @@ private int[] f(int[] nums, int i) {
         int k1 = 0, k2 = 0;
         Map<Integer, Integer> cnt = new HashMap<>();
         for (; i < nums.length; i += 2) {
-           cnt.merge(nums[i], 1, Integer::sum);
+            cnt.merge(nums[i], 1, Integer::sum);
         }
         for (var e : cnt.entrySet()) {
             int k = e.getKey(), v = e.getValue();