题目均在leetcode
解法一:
暴力解法
两种情况,目标值在所有元素之后以及目标替换掉第一个比他大的元素
class Solution:
def searchInsert(self, nums, target) -> int:
for i in nums:
if i >= target:
return nums.index(i)
return len(nums)
if __name__ == "__main__":
nums = [1,3,5,6]
target = 5
exa = Solution()
print(exa.searchInsert(nums, target))
解法二:
二分法
class Solution:
def searchInsert(self, nums, target) -> int:
n = len(nums)
left = 0
right = n - 1
while left <= right:
mid = int(left + ((right - left)/2))
if nums[mid] > target:
right = mid - 1
elif nums[mid] < target:
left = mid + 1
else:
return mid
return right + 1
if __name__ == "__main__":
nums = [1,3,5,6]
target = 5
exa = Solution()
print(exa.searchInsert(nums, target))
由于我刚从C++转过来,需要注意的是,在python3中,整型相除的结果是浮点型。在此题中需要自己将结果转为int型。另外,代码中的left + ((right - left)/2)等价于(left + right)/2,这么做的目的是防止整型溢出。因为left和right的值过大的话,两数相加会超出int型整数范围。还需要值得注意的是二分法的边界处理。
27. Remove Element
解法一:
暴力解法
class Solution:
# @classmethod
def removeElement(self, nums, val) -> int:
for i in nums[:]:
if i == val:
nums.remove(i)
return len(nums)
if __name__ == "__main__":
nums = [1,2,3,3,4,4,5,5,6,7,8,0]
val = 3
a = Solution()
print(a.removeElement(nums,val))
print(nums)
遇到点儿小问题,未修改前报错
Traceback (most recent call last):
File "E:/python_pycharm/leetcode/27. Remove Element.py", line 17, in <module>
print(Solution.removeElement(nums,val))
TypeError: removeElement() missing 1 required positional argument: 'val'
询问度娘后解决,原来是我们在调用定义的类时,没有对其进行实例化。解决办法有两种,一是直接实例化,二是在类内定义的方法之前加上修饰符 @classmethod
另:因为remove直接在nums上进行修改。那么如果for i in nums的话,nums在逐渐变短的过程中,后面的元素会向前移动,顶上前面的位置。那么再循环的时候,实际上把这个顶位的元素跳过去,会产生遗漏的现象。这也就是在for循环中必须加上[:]的原因。
解法二:
双指针法
class Solution:
def removeElement(self, nums, val) -> int:
index1 = 0
index2 = 0
while index1 < len(nums):
if nums[index1] != val:
nums[index2] = nums[index1]
index2 += 1
index1 += 1
return index2
if __name__ == "__main__":
nums = [1,2,3,3,4,4,5,5,6,7,8,0]
val = 3
a = Solution()
print(a.removeElement(nums,val))
print(nums)