367. Valid Perfect Square
367. Valid Perfect Square
class Solution:
def isPerfectSquare(self, num:
LeetCode
69. Sqrt(x)
69. Sqrt(x)
題目是要找出給定一個數字的平方根，如果沒有整數的平方根時，給出最接近的整數後，捨去所有的小數位（不用四捨五入）
題目存在著很簡單的解法，那就是從數字
34. Find First and Last Position of Element in Sorted Array
34. Find First and Last Position of Element in Sorted
704. Binary Search
704. Binary Search
class Solution:
def search(self, nums: List[
374. Guess Number Higher or Lower
374. Guess Number Higher or Lower
# The guess API is
154. Find Minimum in Rotated Sorted Array II
154. Find Minimum in Rotated Sorted Array II
1. 如果中間的值比最右邊的大，
153. Find Minimum in Rotated Sorted Array
153. Find Minimum in Rotated Sorted Array
這個題目存在時間複雜度為線性的解法，那就是不管陣列有沒有排序，線性掃描整個陣列後，
81. Search in Rotated Sorted Array II
81. Search in Rotated Sorted Array II
class Solution:
def
33. Search in Rotated Sorted Array
33. Search in Rotated Sorted Array
1. 中間的值和目標相同：答案
2.
247. Strobogrammatic Number II
247. Strobogrammatic Number II
根據 Leetcode 的資料，這一題是 Google 常見的考題，