-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path13_count_odd_range.cpp
More file actions
51 lines (29 loc) · 834 Bytes
/
13_count_odd_range.cpp
File metadata and controls
51 lines (29 loc) · 834 Bytes
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
43
44
45
46
47
48
49
50
51
// 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].
// My approach but not optimal and brute force too
class Solution {
public:
int countOdds(int low, int high) {
int count=0;
for(int i=low;i<=high;i++){
if(i%2!=0){
count++;
}
}
return count;
}
};
// Optimal solution and
class Solution {
public:
int countOdds(int low, int high) {
return (high + 1) / 2 - (low / 2);
}
};