Skip to content

Commit 4e6bfa4

Browse files
Daryl-sourceDaryl-source
committed
add solution for 206
1 parent 6a0dcfe commit 4e6bfa4

File tree

7 files changed

+66
-0
lines changed

7 files changed

+66
-0
lines changed

‎.idea/.gitignore‎

Lines changed: 8 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/Coding_basic.iml‎

Lines changed: 8 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/inspectionProfiles/profiles_settings.xml‎

Lines changed: 6 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/misc.xml‎

Lines changed: 4 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/modules.xml‎

Lines changed: 8 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/vcs.xml‎

Lines changed: 6 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎Algorithm/ArrayAndLink/206_reverse-linked-list/Daryl.py‎

Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
# Definition for singly-linked list.
2+
# class ListNode(object):
3+
# def __init__(self, val=0, next=None):
4+
# self.val = val
5+
# self.next = next
6+
class Solution(object):
7+
def reverseList(self, head):
8+
"""
9+
:type head: ListNode
10+
:rtype: ListNode
11+
Use two indicators pointing to two nodes which are the previous node and the current node, loop through the head node,
12+
change the previous direction to make the current node become the next node of the previous node, meanwhile, preserve
13+
the next node of the current node just in case of loss reference, at the end of the loop, the previous node is the newer head node.
14+
Time complexity: O(n)
15+
Space complexity: O(1)
16+
"""
17+
if not head:
18+
return head
19+
pre_node = None
20+
current_node = head
21+
while current_node:
22+
next_node = current_node.next
23+
current_node.next = pre_node
24+
pre_node = current_node
25+
current_node = next_node
26+
return pre_node

0 commit comments

Comments
 (0)