leetcode#35 Search Insert Position

1. 문제

• https://leetcode.com/problems/search-insert-position/
  

2. 나의 풀이

2-1.

class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        if nums.count(target) > 0:
            return nums.index(target)
        for (index, num) in enumerate(nums):
            if num < target:
                continue
            return index
        return len(nums)

3. 남의 풀이