ARTS-week6

Algorithm

給定一個已按照升序排列 的有序數組，找到兩個數使得它們相加之和等於目標數。函數應該返回這兩個下標值 index1 和 index2，其中 index1 必須小於 index2

Two Sum II - Input array is sorted

# 解1，時間複雜度O(n)，空間複雜度O(1)
class Solution1:    
    def twoSum(self, numbers: List[int], target: int) -> List[int]:        
        l,r = 0,len(numbers)-1        
        while l < r:            
            if numbers[l] + numbers[r] == target:                
                return [l + 1, r + 1]            
            elif numbers[l] + numbers[r] < target:                
                l += 1            
            else:                
                r -= 1        
        return []
        
 # 解2，時間複雜度O(nlogn)，空間複雜度O(1)
 class Solution2:    
    def twoSum(self, numbers: List[int], target: int) -> List[int]:        
        for n in range(len(numbers)):            
            l,r = n + 1,len(numbers) - 1            
            tmp = target - numbers[n]            
            while l <= r :                
                mid = l + (r - l) // 2                
                if numbers[mid] == tmp:                    
                    return [n + 1,mid + 1]                
                elif numbers[mid] < tmp:                    
                    l = mid + 1                
                else:                    
                    r = mid - 1        
        return []

Review

Chaining Requests in Postman — Part 1

• postman 建立collection，添加請求
• 調試GET User Details、Upload Photo Test和Confirm the image upload接口
  • 其中GET User Details接口中的Authorization參數爲空也能返回結果，與API doc不符
  • 實際調試時，Pre-request script未起做用（不寫也能經過）
• 設置環境變量以/設置返回值的參數爲環境變量
• 設置斷言，測試結果

Tip

appium 啓動時報錯，An unknow server-side error occurred while processing the command...
換成UiAutomator1啓動正常，懷疑是UiAutomator2問題。從新安裝appium問題已解決（未能定位到確切緣由）

Share

別讓本身「牆」了本身