1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
| # Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def doubleIt(self, head: Optional[ListNode]) -> Optional[ListNode]:
if head.val > 4:
head = ListNode(0, head)
node = head
while node:
node.val = (node.val * 2) % 10
if node.next and node.next.val > 4:
node.val += 1
node = node.next
return head
|