第一题
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
j=0
for i in range(len(nums)):
if nums[i]==target:
return i
else:
if nums[i]>target:
return i
if i==len(nums)-1:
return i+1
第二题
class Solution:
def findEvenNumbers(self, digits: List[int]) -> List[int]:
ans=set()
n=len(digits)
for i in range(n):
for j in range(n):
for k in range(n):
if i==j or j==k or i==k:
continue
num=digits[i]*100+digits[j]*10+digits[k]
if num>=100 and num%2==0:
ans.add(num)
return sorted(list(ans))