190. Reverse Bits（leetcode）

Reverse bits of a given 32 bits unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110000010100101000000).

Follow up:
If this function is called many times, how would you optimize it?

Related problem: Reverse Integer

 1 class Solution {
 2 public:
 3     uint32_t reverseBits(uint32_t n) {
 4         bitset<32> bis(n);
 5         //cout << bis[1] << endl;
 6         bitset<32> bis1;
 7         int j = 0;
 8         for (int i = 31;i >= 0;i--)
 9         {
10             bis1[j]= bis[i];
11             j++;
12         }
13
14         return bis1.to_ulong();
15     }
16 };
时间： 2024-12-14 18:46:22

190. Reverse Bits（leetcode）的相关文章

190. Reverse Bits （Binary）

>>>表示无符号右移,左边空出的位以0填充>>=右移赋值>>>=无符号右移赋值<<= 左移赋值<<左移 1 class Solution { 2 // you need treat n as an unsigned value 3 public int reverseBits(int n) { 4 int res = 0; 5 for(int i = 0; i < 32; i++) { 6 res <<= 1; 7

leetcode——190 Reverse Bits（32位无符号二进制数的翻转）

Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110000010100101000000). Follow up: If this function

Leetcode 190. Reverse Bits（反转比特数）

Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110000010100101000000). Follow up: If this function

LeetCode 190. Reverse Bits （反转位）

Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110000010100101000000). 题目标签: Bit Manipulation 这道题目

【leetcode】Reverse Bits（middle）

Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as00111001011110000010100101000000). 思路: n一直右移, ans一直左移. class So

191. Number of 1 Bits（LeetCode）

Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight). For example, the 32-bit integer '11' has binary representation 00000000000000000000000000001011, so the function should retu

119. Pascal&#39;s Triangle II（LeetCode）

Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1]. Note:Could you optimize your algorithm to use only O(k) extra space? class Solution { public: vector<int> getRow(int rowIndex) { vector<int&

（LeetCode）杨辉三角形Pascal&#39;s Triangle

题目如下: Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] 实现代码如下: public class Solution { public List<List<Integer>> generate(int numRows) { Lis

第15个算法-实现 Trie (前缀树)（LeetCode）

解法代码来源 :https://blog.csdn.net/whdAlive/article/details/81084793 算法来源:力扣(LeetCode)链接:https://leetcode-cn.com/problems/implement-trie-prefix-tree 实现一个 Trie (前缀树),包含 insert, search, 和 startsWith 这三个操作. 示例: Trie trie = new Trie(); trie.insert("apple"