这里写自定义目录标题
1.
这道题很简单,直接贴代码:
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
length=len(nums)
for i in range(length):
if nums[i]==target:
return i
elif nums[i]>target:
nums.insert(i,target)
return i
nums.append(target) #target比nums中所有数都大
return length
2.题目如下:
这道题真是绕得很,代码如下:
class Solution:
def countAndSay(self, n: int) -> str:
arr = ["1"]
for i in range(n-1):
tmp = ""
j = 0
while j < len(arr[i]):
num = arr[i][j]
time = 0
while j <len(arr[i]) and num == arr[i][j]:
j += 1 # 同上一个相同则继续找
time += 1 # 次数加一
tmp = tmp + str(time) + num
arr.append(tmp)
return arr[n-1]