-
Notifications
You must be signed in to change notification settings - Fork 4.9k
/
CountOddNumbersInAnIntervalRange.cpp
42 lines (40 loc) · 1.2 KB
/
CountOddNumbersInAnIntervalRange.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
// Source : https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/
// Author : Hao Chen
// Date : 2020-10-07
/*****************************************************************************************************
*
* Given two non-negative integers low and high. Return the count of odd numbers between low and high
* (inclusive).
*
* Example 1:
*
* Input: low = 3, high = 7
* Output: 3
* Explanation: The odd numbers between 3 and 7 are [3,5,7].
*
* Example 2:
*
* Input: low = 8, high = 10
* Output: 1
* Explanation: The odd numbers between 8 and 10 are [9].
*
* Constraints:
*
* 0 <= low <= high <= 10^9
******************************************************************************************************/
class Solution {
public:
int countOdds1(int low, int high) {
//remove the edge cases, make it as same pattern - both low and high are odd number.
if (high % 2 == 0) high--;
if (low % 2 == 0 ) low++;
return (high-low)/2+1;
}
int countOdds2(int low, int high) {
return (high+1)/2 - low/2;
}
int countOdds(int low, int high) {
return countOdds2(low, high);
return countOdds1(low, high);
}
};