技術分享
LeetCode
Leetcode
141. Linked List Cycle
Leetcode 分享筆記141. Linked List Cycle題目 class Solution(object): def hasCycle(self, head): """ :type head: ListNode :rtype: bool """ while head and head.next: if str(head.val) == "visited": return True head.val = "visited" head = head.next return...
83. Remove Duplicates from Sorted List
Leetcode 分享筆記83. Remove Duplicates from Sorted List題目 class Solution(object): def deleteDuplicates(self, head): """ :type head: ListNode :rtype: ListNode """ if head == None: return head curr = head while curr.next != None: if curr.val == curr.next.val: curr.next =...
1290. Convert Binary Number in a Linked List to Integer
Leetcode 分享筆記1290. Convert Binary Number in a Linked List to Integer題目 class Solution(object): def getDecimalValue(self, head): """ :type head: ListNode :rtype: int """ curr = head ans = [] output = 0 while curr != None: ans.append(curr.val) curr = curr.next for i in...
237. Delete Node in a Linked List
Leetcode 分享筆記237. Delete Node in a Linked List題目 class Solution(object): def deleteNode(self, node): """ :type node: ListNode :rtype: void Do not return anything, modify node in-place instead. """ node.val = node.next.val # Node Value等於Node的下一個Node的Value node.next =...
876. Middle of the Linked List
Leetcode 分享筆記876. Middle of the Linked List題目 class Solution(object): def middleNode(self, head): """ :type head: ListNode :rtype: ListNode """ slow = head # ListNode slow fast = head # ListNode fast while fast: if fast.next ==None or fast.next.next == None: if...
206. Reverse Linked List
Leetcode 分享筆記 206. Reverse Linked List等級: easy題目
Get Instant Access to Financial News & Advice
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation