Leet Code OJ 231. Power of Two [Difficulty: Easy]
来源：互联网 发布：菜鸟驿站 不是淘宝 编辑：程序博客网 时间：2024/05/02 02:22
题目：
Given an integer, write a function to determine if it is a power of two.
分析：
题意是给定一个整数，判断它是不是2的幂。
代码实现：
public class Solution { public boolean isPowerOfTwo(int n) { if(n<1){ return false; } if(n==1){ return true; } if((n&1)==0) { return isPowerOfTwo(n/2); } else{ return false; } }} 0 0
- Leet Code OJ 231. Power of Two [Difficulty: Easy]
- Leet Code OJ 326. Power of Three [Difficulty: Easy]
- Leet Code OJ 21. Merge Two Sorted Lists [Difficulty: Easy]
- Leet Code OJ 1. Two Sum [Difficulty: Easy]
- Leet Code OJ 1. Two Sum [Difficulty: Easy]
- Leet Code OJ 1. Two Sum [Difficulty: Easy]
- Leet Code OJ 1. Two Sum [Difficulty: Easy]
- Leet Code OJ 58. Length of Last Word [Difficulty: Easy]
- Leet Code OJ 191. Number of 1 Bits [Difficulty: Easy]
- Leet Code OJ 104. Maximum Depth of Binary Tree [Difficulty: Easy]
- Leet Code OJ 235. Lowest Common Ancestor of a Binary Search Tree [Difficulty: Easy]
- Leet Code OJ 4. Median of Two Sorted Arrays [Difficulty: Hard]
- Leet Code OJ 292. Nim Game [Difficulty: Easy]
- Leet Code OJ 242. Valid Anagram [Difficulty: Easy]
- Leet Code OJ 258. Add Digits [Difficulty: Easy]
- Leet Code OJ 226. Invert Binary Tree [Difficulty: Easy]
- Leet Code OJ 283. Move Zeroes [Difficulty: Easy]
- Leet Code OJ 217. Contains Duplicate [Difficulty: Easy]
- 实用的cmd命令
- 通过JS使用Twitter登录自己的网站
- 用java方式将微软文档转换成在线网页
- python pdb调试
- 关于16年2月14日以后上传AppStore出现：Missing iOS Distribution signing identity for...的问题
- Leet Code OJ 231. Power of Two [Difficulty: Easy]
- 图片压缩
- UVA 1635(p320)----Irrelevant Elements
- java并发处理小技巧
- 关于weblogic 12c 部署ear应用包时 出现Exception: 48188的一种解决方法
- Logback浅析
- request.getParameter() VS request.getAttribute()
- .net笔试题（二）
- SAS Macro STPBEGIN
