Skip to content
Permalink
Branch: master
Find file Copy path
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
44 lines (30 sloc) 754 Bytes

6.Math

题目描述

Given a positive integernum, write a function which returns True ifnumis a perfect square else False.

Note:Do notuse any built-in library function such assqrt.

Example 1:

Input: 16
Returns: True

Example 2:

Input: 14
Returns: False

题目链接

https://leetcode.com/problems/valid-perfect-square/description/

Java

代码

class Solution {
    public boolean isPerfectSquare(int num) {
        if (num == 1) return true;
        for (int i = 1; i <= num / 2; i++) {
            if (i * i == num) return true;
            if (i * i > num) return false;
        }
        return false;
    }
}
You can’t perform that action at this time.