Leetcode 633. Sum of Square Numbers

633. Sum of Square Numbers

アプローチ

Two Pointer

class Solution {
    public boolean judgeSquareSum(int c) {
        if (c == 1) {
            return true;
        }
        long low = 0;
        long high = (long) Math.sqrt(c);

        while (low <= high) {
            long sum = low * low + high * high;
            if (sum == c) {
                return true;
            }
            if (sum < c) {
                low++;
            } else {
                high--;
            }
        }
        return false;
    }
}