Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 369 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 369 # by problem number
lcpy gen -s plus_one_linked_list # by problem name
head of the list.
Input: head = [1,2,3]
Output: [1,2,4]
Input: head = [0]
Output: [1]
[1, 100].0 <= Node.val <= 9from leetcode_py import ListNode
class Solution:
# Time: O(n)
# Space: O(1)
def plus_one(self, head: ListNode[int] | None) -> ListNode[int] | None:
dummy = ListNode(0)
dummy.next = head
# rightmost node not equal to 9
last_not_nine = dummy
node = head
while node is not None:
if node.val != 9:
last_not_nine = node
node = node.next
last_not_nine.val += 1
node = last_not_nine.next
while node is not None:
node.val = 0
node = node.next
return dummy if last_not_nine is dummy else head
| Time | Space |
|---|---|
| O(n) | O(1) |