二分法 x的平方根&快速幂

leetcode 69:x的平方根

def mysqrt(x):
	if x<2: return x
	left = 0
	right = x//2
	while left<=right:
		mid =(left+right)//2
		num = mid*mid
		if num>x:
			right = mid -1
		elif num <x:
			left = mid+1
		else:
			return mid
	return right

leetcode 50 快速幂pow(x,n)

def quickSort(x,n):
	res=1
	if n < 0:
		x=1/x
		n=-n
	while n>0:
		if n&1:
			res*=x
		x*=x
		n>>=1
	return res