LeetCode 191. Number of 1 Bits
Command Palette
Search for a command to run...
Comments
Join the discussionNo comments yet. Be the first to comment.
More from this blog
LeetCode 153. Find Minimum in Rotated Sorted Array
Question Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: [4,5,6,7,0,1,2] if it was rotated 4 times. [0,1,2,4,5,6,7] if it was rotated 7 times. No...
Jun 29, 20254 min read
LeetCode 268: Missing Number
class Solution { public: int missingNumber(vector<int>& nums) { int result = nums.size(); for (int i = 0; i < nums.size(); i++) { result ^= i ^ nums[i]; } return result; } }; Question Given an ar...
Jun 27, 20252 min read
LeetCode 338: Counting Bits
Problem Overview Given an integer n, return an array ans of length n + 1 where ans[i] is the number of set bits in the binary representation of i. Example: n = 5 → Output: [0, 1, 1, 2, 1, 2] Constraints: 0 <= n <= 10^5 Solution 1: Brute Force Thi...
Jun 26, 20252 min read
Bruce Lin
4 posts