367. Valid Perfect Square 难度:medium
来源:互联网 发布:软件研发部 职能 编辑:程序博客网 时间:2024/06/02 20:48
题目:
Given a positive integer num, write a function which returns True if num is a perfect square else False.
Note: Do not use any built-in library function such as sqrt
.
Example 1:
Input: 16Returns: True
Example 2:
Input: 14Returns: False
思路:
二分查找即可。
程序:
class Solution {public: bool isPerfectSquare(int num) { if(num < 1) return false; if(num == 1) return true; int left = 0, right = num / 2; while(left <= right) { long mid = (left+right)/2; long val = mid*mid; if(val == num) return true; else if(val > num) right = mid-1; else left = mid+1; } return false; }};
0 0
- 367. Valid Perfect Square 难度:medium
- Leetcode 367. Valid Perfect Square (Medium) (cpp)
- Leetcode 367. Valid Perfect Square[medium]
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square
- 367. Valid Perfect Square**
- java设计模式-享元模式
- Azure Bot中的Attribute+Enum+流畅接口实现
- ajax与HTML5 history pushState/replaceState
- java JDK 基础知识。
- 385. Mini Parser
- 367. Valid Perfect Square 难度:medium
- Java中线程解说
- Android 日志管理框架 NativeLogger
- mysql中like只能用?的参数化查询
- Delphi 7编写的Webservice生成的DLL部署到IIS上
- sicily 计算二叉查找树的高度 期末考试题
- Fragment静态添加
- 【LeetCode】 094. Binary Tree Inorder Traversal
- Webview截屏三种方式