367. Valid Perfect Square

Posted 2020-09-25 apanda009

https://leetcode.com/problems/valid-perfect-square/#/solutions

public boolean isPerfectSquare(int num) {
        int beg = 1, end = num / 2 + 1;
        while (beg + 1 < end) {
            int mid = beg + (end - beg) / 2;
            if (num / mid == mid && num % mid == 0) {
                return true;
            } else if (num / mid < mid) {
                end = mid;
            } else {
                beg = mid;
            }
        }
        if (num / beg == beg && num % beg == beg || num / end == end && num % end == 0) {
            return true;
        } else {
            return false;
        }
    }