mirror of
				https://gitee.com/coder-xiaomo/leetcode-problemset
				synced 2025-11-04 11:43:12 +08:00 
			
		
		
		
	
		
			
				
	
	
		
			31 lines
		
	
	
		
			914 B
		
	
	
	
		
			HTML
		
	
	
	
	
	
			
		
		
	
	
			31 lines
		
	
	
		
			914 B
		
	
	
	
		
			HTML
		
	
	
	
	
	
<p>Given a positive integer <code>num</code>, return <em>the number of positive integers <strong>less than or equal to</strong></em> <code>num</code> <em>whose digit sums are <strong>even</strong></em>.</p>
 | 
						|
 | 
						|
<p>The <strong>digit sum</strong> of a positive integer is the sum of all its digits.</p>
 | 
						|
 | 
						|
<p> </p>
 | 
						|
<p><strong>Example 1:</strong></p>
 | 
						|
 | 
						|
<pre>
 | 
						|
<strong>Input:</strong> num = 4
 | 
						|
<strong>Output:</strong> 2
 | 
						|
<strong>Explanation:</strong>
 | 
						|
The only integers less than or equal to 4 whose digit sums are even are 2 and 4.    
 | 
						|
</pre>
 | 
						|
 | 
						|
<p><strong>Example 2:</strong></p>
 | 
						|
 | 
						|
<pre>
 | 
						|
<strong>Input:</strong> num = 30
 | 
						|
<strong>Output:</strong> 14
 | 
						|
<strong>Explanation:</strong>
 | 
						|
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.
 | 
						|
</pre>
 | 
						|
 | 
						|
<p> </p>
 | 
						|
<p><strong>Constraints:</strong></p>
 | 
						|
 | 
						|
<ul>
 | 
						|
	<li><code>1 <= num <= 1000</code></li>
 | 
						|
</ul>
 |