页面顶部 Top
文件:  root - text - article - 2020 - 01 - determine-if-linked-list-is-palindrome.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 173 次阅读, 22033 次搜索 | 102 个单词

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Microsoft:

You are given a doubly linked list. Determine if it is a palindrome.

Can you do this for a singly linked list?


class Node(object):
def __init__(self, val):
self.val = val
self.next = None
self.prev = None

def is_palindrome(node):
# Fill this in.

node = Node('a')
node.next = Node('b')
node.next.prev = node
node.next.next = Node('b')
node.next.next.prev = node.next
node.next.next.next = Node('a')
node.next.next.next.prev = node.next.next

print is_palindrome(node)
# True
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 173 次阅读, 22033 次搜索 | 102 个单词 定阅此目录的博客

猜您喜欢...

  1. Algorithm Interview: No Adjacent Repeating Characters
  2. Plus One
  3. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  4. Algorithm Interview Question: Symmetric k-ary Tree
  5. Daily Interview Problem: 3 Sum
  6. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  7. Daily Interview Problem: Look and Say Sequence
  8. Fibonacci coding
  9. Daily Interview Problem: Merge K Sorted Linked Lists
  10. Daily Interview Problem: Validate Binary Search Tree

评论 (0)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />