###leetcode
###寻找数组的中心索引
class Solution:
def pivotIndex(self,nums):
i=0
nums_left=0
nums_all=sum(nums)
for i in range(len(nums)):
nums_left+=nums[i]
if nums_left*2==nums_all+nums[i]:
return i
break
return -1
###搜索插入位置(方法一比较好)
###方法一
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
for i in range(len(nums)):
if target<=nums[i]:
return i
break
return len(nums)
###方法二:二分法
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
if len(nums) < 1: return 0
left = 0
right = len(nums) - 1 # 这里使用闭区间
while(left <= right):
mid = left + (right - left) // 2
if nums[mid] == target:
return mid
elif nums[mid] > target:
right = mid - 1
else:
left = mid + 1
return right + 1
###合并区间(我不会)
class Solution:
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
"""
方法:排序
"""
intervals.sort(key = lambda x : x[0])###按第一位排序
merges = list()
for interval in intervals:
if not merges or merges[-1][-1] < interval[0]:
merges.append(interval)
else:
merges[-1][-1] = max(merges[-1][-1], interval[1])
return merges
链接:https://leetcode.cn/leetbook/read/array-and-string/c5tv3/?discussion=s6T5BM