add 2180

Steve Sun · Steve Sun · commit c11838949f83 · 2022-02-19T20:07:50.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 | #    |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |------|----------------|---------------|--------|-------------|-------------
+| 2180 |[Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2180.java) ||Easy||
 | 2177 |[Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2177.java) ||Medium||
 | 2176 |[Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2176.java) ||Easy||
 | 2169 |[Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2169.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2180.java b/src/main/java/com/fishercoder/solutions/_2180.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2180 {
+    public static class Solution1 {
+        public int countEven(int num) {
+            int ans = 0;
+            for (int i = 1; i <= num; i++) {
+                List<Integer> list = getAllDigits(i);
+                int sum = 0;
+                for (int l : list) {
+                    sum += l;
+                }
+                if (sum % 2 == 0) {
+                    ans++;
+                }
+            }
+            return ans;
+        }
+
+        private List<Integer> getAllDigits(int num) {
+            List<Integer> ans = new ArrayList<>();
+            while (num != 0) {
+                ans.add(num % 10);
+                num /= 10;
+            }
+            return ans;
+        }
+    }
+}
