lintcode系列——56，60,64,69

56.Two Sum

class Solution:
    """
    @param numbers: An array of Integer
    @param target: target = numbers[index1] + numbers[index2]
    @return: [index1, index2] (index1 < index2)
    """
    def twoSum(self, numbers, target):
        # write your code here
        hash={}
        for i in range(len(numbers)):
            if target - numbers[i] in hash:
                return [hash[target-numbers[i]], i]
            hash[numbers[i]] = i 
        return [-1, -1]

60. Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume NO duplicates in the array.

class Solution:
    """
    @param A: an integer sorted array
    @param target: an integer to be inserted
    @return: An integer
    """
    def searchInsert(self, A, target):
        # write your code here
        if len(A) == 0:
            return 0
            
        #最小数大于等于target
        if A[0]>=target:
            return 0
        # 这里的if分支可省略
        # if A[-1] == target: # 最大的数等于target,返回长度n-1
        #    return n-1
        # elif A[-1] < target: # 最大的数小于target,插入末尾,返回长度n
        #    return n
        n = len(A)
        # 其余情况，反向遍历列表，找到第一个小于等于target的数
        for i in range(-1,-n,-1):
            if A[i] > target: # 大于target,继续循环
                continue
            elif A[i] == target: # 等于，返回n+i;因为i是负数,反向循环
                return n+i
            else:
                return n+i+1 # 小于target，在n+i位置之后插入元素，返回n+i+1

64,Merge Sorted Array

class Solution:
    """
    @param: A: sorted integer array A which has m elements, but size of A is m+n
    @param: m: An integer
    @param: B: sorted integer array B which has n elements
    @param: n: An integer
    @return: nothing
    """
    def mergeSortedArray(self, A, m, B, n):
        # write your code here
        for i in range(n):
            A[i+m] = B[i]
        A.sort()

class Solution:
    """
    @param: A: sorted integer array A which has m elements, but size of A is m+n
    @param: m: An integer
    @param: B: sorted integer array B which has n elements
    @param: n: An integer
    @return: nothing
    """
    def mergeSortedArray(self, A, m, B, n):
        # write your code here
        i = m-1
        j = n-1
        index = m+n-1  #从最后一个序列index向前依次插入
        while i>=0 and j>=0:
            if A[i]<B[j]: 
                A[index] = B[j] 
                j -= 1
            else:
                A[index] = A[i]
                i -= 1 
            index -= 1 
        
        while j>=0:  # i<0退出上面循环
            A[index] = B[j]
            index -=1  
            j-= 1 

69 Binary Tree Level Order Traversal

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""
#中序遍历的非递归做法
from collections import deque
class Solution:
    """
    @param root: A Tree
    @return: Level order a list of lists of integer
    """
    def levelOrder(self, root):
        # write your code here
        if root is None:
            return []
        queue = deque([root])
        result = []
        while queue:
            level = []
            for _ in range(len(queue)):
                node = queue.popleft()
                level.append(node.val)
                if node.left:
                    queue.append(node.left)
                if node.right:
                    queue.append(node.right)
            result.append(level)
        return result