LeetCode : Power of Two

Given an integer, write a function to determine if it is a power of two.

class Solution {
public:bool isPowerOfTwo(int n) {if(n<1)return false;if(n==1)return true;elseif(n%2==0)return isPowerOfTwo(n/2);elsereturn false;}
};

转载于:https://www.cnblogs.com/chankeh/p/6850095.html

LeetCode : Power of Two相关推荐

[LeetCode] Power of Two 判断2的次方数
Given an integer, write a function to determine if it is a power of two. Example 1: Input: 1 Output: ...
[LeetCode]Power
周五的晚上,女朋友看爸爸去哪儿,电脑都是我的,狂刷LeetCode,做了十来题,最有印象的还是Power.题目如下: Implement pow(x, n).就是实现x的n次方. 这是一题很传统的题目 ...
[LeetCode] Power of Four
Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Gi ...
LeetCode Power of Three
题意:不用循环,判断一个数是否是3的幂思路:通过判断指数是否是整数注意用Math.log函数有的返回不正确,用Math.log10 代码如下: public class Solution {pub ...
LeetCode Power of Two
判断一个数是不是2的幂,有三种方法第一种,直接右移操作,看对2取模是否为1 代码如下 public class Solution {public boolean isPowerOfTwo(int n ...
[leetcode] Power of Two 判断一个数是否是2的平方
bool isPowerOfTwo(int n) {int count = 0;int i = 0;if(n < 0)return false;for(i = 0; i < sizeof( ...
LeetCode 2156. 查找给定哈希值的子串（字符串哈希）
文章目录 1. 题目 2. 解题 1. 题目给定整数 p 和 m ,一个长度为 k 且下标从 0 开始的字符串 s 的哈希值按照如下函数计算: hash(s,p,m)=(val(s[0])∗p0+v ...
[LeetCode][JavaScript]Power of Three
Power of Three Given an integer, write a function to determine if it is a power of three. Follow up: ...
leetcode python3 简单题231. Power of Two
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第二百三十一题 (1)题目英文: Given an integer, write ...

LeetCode : Power of Two

LeetCode : Power of Two相关推荐

最新文章

热门文章