[LeetCode]reverse linked list (완료)

[yeonghwanjeon]

• 문제링크
• 나의 풀이 : Linked list를 잘 옮기면서 쓰는 것이 중요함 / next가 제대로 저장되는지 손으로 적어가면서 풀 것

  
  # Definition for singly-linked list.
  # class ListNode(object):
  #     def __init__(self, x):
  #         self.val = x
  #         self.next = None

class Solution(object): def reverseList(self, head): """ :type head: ListNode :rtype: ListNode """ ret = None now = head while True : if now is None : return None

        new = ListNode(now.val)
        new.next = ret
        ret = new

        now = now.next
        if now is None :
            break

    return new