Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g2101_2200.s2180_count_integers_with_even_digit_sum.Solution

```
public class Solution
extends Object
```
2180 - Count Integers With Even Digit Sum.
Easy

Given a positive integer num, return the number of positive integers less than or equal to num whose digit sums are even.

The digit sum of a positive integer is the sum of all its digits.

Example 1:

Input: num = 4

Output: 2

Explanation:

The only integers less than or equal to 4 whose digit sums are even are 2 and 4.

Example 2:

Input: num = 30

Output: 14

Explanation:

The 14 integers less than or equal to 30 whose digit sums are even are

2, 4, 6, 8, 11, 13, 15, 17, 19, 20, 22, 24, 26, and 28.

Constraints:
- 1 <= num <= 1000

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int countEven(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- countEven
```
public int countEven(int n)
```