231. Power of Two

问题描述

解决方案

位运算

class Solution {
public:bool isPowerOfTwo(int n) {   return n>0&&!(n&(n-1));  }
};

bitset


class Solution {
public:bool isPowerOfTwo(int n) { if(n>0){bitset<sizeof(int)*8> b(n);if(b.count()==1) return true;}return false;}
};

转载于:https://www.cnblogs.com/ucas/p/5794546.html

231. Power of Two相关推荐

leetcode 231. Power of Two 判断是否为2的幂 Java
231. Power of Two Given an integer, write a function to determine if it is a power of two. Credits: ...
leetcode 231. Power of Two
Given an integer, write a function to determine if it is a power of two. class Solution(object):def ...
LeetCode - 231. Power of Two
Given an integer, write a function to determine if it is a power of two. Example 1: Input: 16 Output ...
Leet Code OJ 231. Power of Two [Difficulty: Easy]
题目: Given an integer, write a function to determine if it is a power of two. 分析: 题意是给定一个整数,判断它是不是2的幂 ...
【LeetCode】231. Power of Two
题目: Given an integer, write a function to determine if it is a power of two. 非常简单的一道题目 class Solutio ...
leetcode python3 简单题231. Power of Two
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第二百三十一题 (1)题目英文: Given an integer, write ...
LeetCode - 231. Power of Two - 判断一个数是否2的n次幂－位运算应用实例 - ( C++ )
1.题目:原题链接 Given an integer, write a function to determine if it is a power of two. 给定一个整数,判断该整数是否是2的 ...
LeetCode 231: Power of Two
Given an integer, write a function to determine if it is a power of two. 判断一个数是否是2的幂,判断方法主要依据2的N次幂的特 ...
231 Power of Two 2的幂
给定一个整数,写一个函数来判断它是否是2的幂. 详见:https://leetcode.com/problems/power-of-two/description/ Java实现: class Sol ...

231. Power of Two

问题描述

解决方案

位运算

bitset

231. Power of Two相关推荐

最新文章

热门文章