LeetCode-array1

Related Topics: Array , Binary Search

Describe:

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.

Sample Input&output:

1. Input: [1,3,5,6], 5
   Output: 2
2. Input: [1,3,5,6], 2
   Output: 1
3. Input: [1,3,5,6], 7
   Output: 4
4. Input: [1,3,5,6], 0
   Output: 0

Code:

class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        if target in nums:
            return nums.index(target)
        for i in range(len(nums)-1):
            if target>nums[i] and target<nums[i+1]:
                return i+1
        if target<nums[0]:
            return 0
        return len(nums)

Record:

1. 判断一个元素是否在某个列表中
   if num in nums:
   if num not in nums:
2. 查看指定值在列表中的位置，index方法：
   a=list.index(‘a’) //返回a在列表中第一次出现的位置，默认搜索整个列表
   a=list.index(‘a’,0,3) //返回a在指定切片内第一次出现的位置
3. 缩进就说明在此block下了，不要不必要的缩进 比如if下面两个缩进。