234 palindrome linked list

def (self, head):
  self.list = []
  pt = head
  while pt:
    self.list.append(pt)
    pt = pt.next
  midR = len(self.list) / 2 if len(self.list) % 2 == 0 else (len(self.list)+1) /2
  midL = len(self.list) / 2 - 1 if len(self.list) % 2 == 0 else midR-2
  while midR <= len(self.list) and midL >= 0:
    if self.list[midR].val != self.list[midL].val:
      return False
    midR+=1
    midL-=1
  return True

def (self, head):
    """
    :type head: ListNode
    :rtype: bool
    """
    s = []
    while head is not None:
        s.append(head.val)
        head = head.next
    return s == list(reversed(s))