本文用python3實現基於二分查找的求整數平方根。
python3:
def binarySearchSqrt(n):
low = 1
high = 100
while low <= high:
mid = low + (high - low) // 2
if mid ** 2 == n:
return mid
elif mid ** 2 < n:
low = mid + 1
else:
high = mid -1
return -1
for _ in range(int(input())):
print("please input one number between 1 - 10000")
n = int(input())
print(binarySearchSqrt(n))
測試截圖:
第一行數據爲測試用例數量,之後輸入相應數量的測試用例。