class Solution {
public int mySqrt(int x) {
if(x==0) return 0;
int i;
for(i=1;i<=x;i++) {
if((long)i*i<=x && (long)(i+1)*(i+1)>x) {
break;
}
}
return i;
}
}
答案给了二分法,然而没必要