Leetcode 206. 反转链表
考察链表的操作
classSolution:defreverseList(self,head:Optional[ListNode])->Optional[ListNode]:prev=Nonecurr=headwhilecurr:next_node=curr.nextcurr.next=prev prev=curr curr=next_nodereturnprev考察链表的操作
classSolution:defreverseList(self,head:Optional[ListNode])->Optional[ListNode]:prev=Nonecurr=headwhilecurr:next_node=curr.nextcurr.next=prev prev=curr curr=next_nodereturnprev