leetcode 367. Valid Perfect Square

二分。

    bool isPerfectSquare(int num) {if (num == 0 || num == 1)return true;int start = 0;int end = num;while (start <= end) {int chu = start + (end - start) / 2;int res = num / chu;if (res == chu && num % chu == 0)return true;if (chu > res)end = chu - 1;elsestart = chu + 1;}return false;}

转载于:https://www.cnblogs.com/willaty/p/8436009.html

leetcode 367. Valid Perfect Square相关推荐

[leetcode] 367. Valid Perfect Square
Given a positive integer num, write a function which returns True if num is a perfect square else Fa ...
367. Valid Perfect Square
题目: Given a positive integer num, write a function which returns True if num is a perfect square els ...
C#LeetCode刷题之#367-有效的完全平方数（Valid Perfect Square）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3869 访问. 给定一个正整数 num,编写一个函数,如果 num ...
LeetCode Valid Perfect Square（是否是平方数）
题意:给出一正整数,不用 sqrt函数,判断该数是否是平方数思路: 第一种,连续奇数和为平方数代码如下: public class Solution {public boolean isPerfe ...
Leetcode 279. Perfect Square
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 1 ...
【To Do! 重点正则表达式】LeetCode 65. Valid Number
LeetCode 65. Valid Number 本博客转载自:[1]http://www.cnblogs.com/yuzhangcmu/p/4060348.html [2]https://blog ...
【回文串14】LeetCode 680. Valid Palindrome II
LeetCode 680. Valid Palindrome II Solution1:我的答案复杂度是O(n)O(n)O(n),不算好啊.. 注意:对于c++中string对象常用的insert( ...
【回文串3】LeetCode 125. Valid Palindrome
LeetCode 125. Valid Palindrome Solution1:我的答案复杂度为O(n)O(n)O(n),写法不是很简练啊. class Solution { public:boo ...
LeetCode 36. Valid Sudoku
LeetCode 36. Valid Sudoku Solution1:我的答案,比较笨.但是清晰易懂好上手啊~~~ class Solution { public:bool isValidSudok ...

leetcode 367. Valid Perfect Square

leetcode 367. Valid Perfect Square相关推荐

最新文章

热门文章