YuAn


  • 首頁

  • 目錄

  • 分類

  • 標籤

  • 關於我

  • 檢索

2220. Minimum Bit Flips to Convert Number

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

problem

solution

1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
public:
int minBitFlips(int start, int goal) {
int n = start^goal, count = 0;
// count one
while(n){
n &=(n-1);
count++;
}
return count;

}
};

analysis

  • time complexity O(n)
  • space complexity O(1)
# Bit Manipulation
2221. Find Triangular Sum of an Array
221. Maximal Square
  • 文章目錄
  • 本站概覽

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
  3. 3. analysis
© 2022 — 2024 YU-AN, Chen
由 Hexo 強力驅動
|
主題 — NexT.Mist v5.1.4