leetcode刷题 8182

class Solution: def search(self, nums, target): l, r, n = 0, len(nums) - 1, len(nums) while l <= r: while l + 1 < n and nums[l + 1] == nums[l]: l += 1 while r > 0 and nums[r] == nums[r - 1]: r -= 1 mid = (l + r) // 2 if nums[mid] == target: return True elif sum((target < nums[l], nums[l] <= nums[mid], nums[mid] < target)) == 2: l = mid + 1 else: r = mid - 1 return False # return target in nums

class Solution: def deleteDuplicates(self, head: ListNode) -> ListNode: dummy = ListNode(-1) dummy.next = head p = dummy while p.next: if p.next.next and p.next.val == p.next.next.val: z = p.next while z and z.val == p.next.val: z = z.next p.next = z else: p = p.next return dummy.next class Solution: def deleteDuplicates(self, head: ListNode) -> ListNode: buffr = prev = ListNode(None) buffr.next = itr = head val = None while itr: nxt = itr.next if itr.val == val or (itr.next and itr.next.val == itr.val): prev.next, itr.next = itr.next, None else: prev = itr itr, val = nxt, itr.val # move pointer forward and update previous val return buffr.next 刘润森！ 认证博客专家 Python Java 前端 17年就读于东莞XX学院化学工程与工艺专业，GitChat作者。Runsen的微信公众号是"Python之王"，因为Python入了IT的坑，从此不能自拔。公众号内容涉及Python，Java计算机、杂谈。干货与情怀同在。喜欢的微信搜索：「Python之王」。个人微信号：RunsenLiu。不关注我公号一律拉黑！！！