mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 00:25:22 +08:00
规范格式
This commit is contained in:
32
leetcode/0231.Power-of-Two/README.md
Executable file
32
leetcode/0231.Power-of-Two/README.md
Executable file
@ -0,0 +1,32 @@
|
||||
# [231. Power of Two](https://leetcode.com/problems/power-of-two/)
|
||||
|
||||
## 题目
|
||||
|
||||
Given an integer, write a function to determine if it is a power of two.
|
||||
|
||||
**Example 1:**
|
||||
|
||||
Input: 1
|
||||
Output: true
|
||||
Explanation: 2^0 = 1
|
||||
|
||||
**Example 2:**
|
||||
|
||||
Input: 16
|
||||
Output: true
|
||||
Explanation: 2^4 = 16
|
||||
|
||||
**Example 3:**
|
||||
|
||||
Input: 218
|
||||
Output: false
|
||||
|
||||
## 题目大意
|
||||
|
||||
给定一个整数,编写一个函数来判断它是否是 2 的幂次方。
|
||||
|
||||
|
||||
## 解题思路
|
||||
|
||||
- 判断一个数是不是 2 的 n 次方。
|
||||
- 这一题最简单的思路是循环,可以通过。但是题目要求不循环就要判断,这就需要用到数论的知识了。这一题和第 326 题是一样的思路。
|
Reference in New Issue
Block a user