Count Odd Numbers in an Interval Range - Math - Easy - LeetCode
💻 coding

Count Odd Numbers in an Interval Range - Math - Easy - LeetCode

1 min read 95 words
1 min read
ShareWhatsAppPost on X
  • 1The task is to count odd numbers between two non-negative integers, low and high, inclusive.
  • 2The count can be calculated efficiently with a time complexity of O(1) and space complexity of O(1).
  • 3Examples illustrate that the odd numbers between given ranges can be easily identified and counted.

AI-generated summary · May not capture all nuances

Key Insight
AskGif

"The task is to count odd numbers between two non-negative integers, low and high, inclusive."

Count Odd Numbers in an Interval Range - Math - Easy - LeetCode

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

public class Solution {
 public int CountOdds(int low, int high) { 
 
 if(low%2==0 && high%2==0){
 return (high-low)/2;
 }
 
 return ((high-low)/2)+1;
 }
}

Time Complexity: O(1)

Space Complexity: O(1)

Enjoyed this article?

Share it with someone who'd find it useful.

ShareWhatsAppPost on X

sumitc91

Published on 2 October 2020 · 1 min read · 95 words

Part of AskGif Blog · coding

You might also like