leetcode 69 sqrt(x)

class Solution {
public:
    int mySqrt(int x){
        long long low = 0, high = x;// 时刻警醒溢出！！
        while(low <= high){
            long long mid =(low + high)/2;
            long long cmp = pow(mid, 2);
            if ( cmp == x)
                return mid;
            else if (cmp > x)
                high = mid - 1;
            else 
                low = mid + 1;
        }
        return high;
    }
};