题解 | #立方根#

class Solution { public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param n int整型 * @return int整型 */ int cuberoot(int n) { // write code here

    int  left = sqrt(sqrt(n));
    int  right = n>>2;
    
    if(left > right)
    {
        swap(left, right);
    }
    
    while(left <= right)
    {
        
        if(left*left*left == n) return left;
        
        if(left*left*left < n && (left+1)*(left+1)*(left+1) >n) return left;
        
        left++;
    }
    
    return 1;
    
}

};