leetcode35：搜索插入位置

思想：

1.判断target是否大于等于nums[i]，若是则return i，反之继续1

2.若循环结束，则返回len（nums）

class Solution:
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        for i in range(0, len(nums)):
            if target <= nums[i]:
                return i
        return len(nums)


if __name__ == "__main__":
    print(Solution().searchInsert([1,3,5,6], 7))

小菜鸟的思想，哈哈哈哈哈。（这样有点耗时呢，可以采取折半查询法）

class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        left, right = 0, len(nums) - 1
        while left <= right:
            mid = left + (right - left) / 2
            if nums[mid] >= target:
                right = mid - 1
            else:
                left = mid + 1

        return left

以上是大佬的思想，学习学习