【VIP】【链表翻转】234. Palindrome Linked List【E】【94】

175 篇文章 0 订阅
157 篇文章 0 订阅

Given a singly linked list, determine if it is a palindrome.

Follow up:
Could you do it in O(n) time and O(1) space?


Subscribe to see which companies asked this question




两种方法,注释掉的比较流氓,把链表的东西拿出来放进list里,然后翻转比较

第二种方法比较正常,而且也满足O(1)的空间条件,设置一快一慢两个pointer,快的走到头的时候,慢的正好在中间
慢的每走一步,都进行一次链表翻转。

然后逐个节点比较





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

class Solution(object):
    def isPalindrome(self, head):
        if head == None or head.next == None :
            return True
        
        h = head 
        fast = head
        slow = head
        prv = None
        temp = None
        
        while fast and fast.next:
            fast = fast.next.next
            temp = slow.next
            slow.next = prv
            prv = slow
            slow = temp
        
        slow = prv
        if fast:
            temp = temp.next
        
        '''
        while temp:
            print temp.val
            temp = temp.next
        print '----'
        while slow:
            print slow.val
            slow = slow.next
        '''
        
        while temp and slow:
            #print temp.val
            if temp.val != slow.val:
                return False
            temp = temp.next
            slow = slow.next
        return True
        
            
        
        '''
        q = []
        
        h = head
        while h :
            q.append(h.val)
            h = h.next
        qq = q[:]
        
        qq.reverse()
        return q == qq
        '''
        
        
        """
        :type head: ListNode
        :rtype: bool
        """
        


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值