leetcode 35 Search Insert Position

#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Tue Jan 23 13:55:51 2018

@author: vicky
"""

class Solution:
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
if target in nums:
return(nums.index(target))
else:
nums.append(target) #合并，list是可变变量，nums自身改变了
nums.sort() #排序
return nums.index(target)

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

x=nums
class Solution(object):
def searchInsert(self, nums, target):
return len([x for x in nums if x<target])
#返回nums中小于target的元素个数,[x for x in nums if x<target]返回元素值