leetcode 刷题 81 82

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

  
 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
 

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

  
 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
 

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

  
 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
 

文章来源: maoli.blog.csdn.net，作者：刘润森！，版权归原作者所有，如需转载，请联系作者。

原文链接：maoli.blog.csdn.net/article/details/90551096