fomoo的博客

class Solution(object): def minArray(self, numbers): """ :type numbers: List[int] :rtype: int """ # return min(numbers) i, j = 0, len(numbers) - 1 while i < j: m = (i + j) // 2 .

class Solution(object): def fib(self, n): """ :type n: int :rtype: int """ dp = [0, 1] for i in range(2,n+1): dp.append(dp[i - 1] + dp[i - 2]) return dp[n] % 1000000007

class CQueue(object): def __init__(self): self.stack1 = [] self.stack2 = [] def appendTail(self, value): """ :type value: int :rtype: None """ self.stack1.append(value) def deleteHead.

# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): def buildTree(self, preorder, inorder): """ .

class Solution(object): def replaceSpace(self, s): """ :type s: str :rtype: str """ res = [] for c in s: if c == " ": res.append("%20") else: res.a.

class Solution(object): def findRepeatNumber(self, nums): """ :type nums: List[int] :rtype: int """ for i in range(len(nums)): while (nums[i] != i): if nums[i] == nums[nums[i]]: .

class Solution(object): def findNumberIn2DArray(self, matrix, target): """ :type matrix: List[List[int]] :type target: int :rtype: bool """ i, j = len(matrix) - 1, 0 while i >= 0 and.