LeetCode(69) Sqrt(x)

class Solution {
public:
    int mySqrt(int x) {

        if(x <= 0)

            return 0;

        long long left = 1;
        long long right = x;

        while(left <= right) {

            long long mid = (left + right) / 2;

            if(x == mid * mid) {

                return mid;

            }

            if(mid * mid > x) 

                right = mid - 1;

            else

                left = mid + 1;

        }

        return right;

    }
};