Download Plus One Linked List.py
# Definition for singly-linked list. # class ListNode(object): # def __init__(self, x): # self.val = x # self.next = None class Solution(object): def plusOne(self, head): """ :type head: ListNode :rtype: ListNode """ dummy = ListNode(0) dummy.next = head place_stop, tail = dummy, dummy # find the tail while tail.next is not None: tail = tail.next if tail.val != 9: place_stop = tail if tail.val != 9: # done tail.val += 1 else: # not yet place_stop.val += 1 place_stop = place_stop.next # set all node behind this place to zero while place_stop is not None: place_stop.val = 0 place_stop = place_stop.next if dummy.val == 0: return dummy.next return dummy
Leetcode 369 Plus One Linked List problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.