YuAn


  • 首頁

  • 目錄

  • 分類

  • 標籤

  • 關於我

  • 檢索

1523. Count Odd Numbers in an Interval Range

發表於 2023-02-13 | 分類於 leetcode

problem

solution

1
2
3
4
5
6
7
8
9
10
11
12
class Solution {
public:
int countOdds(int low, int high) {
int l=low, r = high;
int count = 0;
while(l<r && l%2==0) l++;
while(l<r && r%2==0) r--;
if(l==r) return l%2==1?1:0;
return (r-l)/2+1;

}
};
152. Maximum Product Subarray
150. Evaluate Reverse Polish Notation
  • 文章目錄
  • 本站概覽

642 文章
20 分類
53 標籤
GitHub E-Mail FB Page Instagram
近期文章
  • 1750. Minimum Length of String After Deleting Similar Ends
  • 948. Bag of Tokens
  • 2864. Maximum Odd Binary Number
  • 2570. Merge Two 2D Arrays by Summing Values
  • 1074. Number of Submatrices That Sum to Target
  1. 1. problem
  2. 2. solution
© 2022 — 2024 YU-AN, Chen
由 Hexo 強力驅動
|
主題 — NexT.Mist v5.1.4