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

猜您喜欢...

  1. Algorithm Interview Question: Max and Min with Limited Comparisons
  2. Daily Interview Problem: Reverse Integer
  3. Daily Interview Question: Create a Simple Calculator
  4. Algorithm Interview Question: Nth Fibonacci Number
  5. Staying on a Chess Board
  6. Most Frequent Subtree Sum
  7. Daily Interview Problem: Sort Colors
  8. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  9. Longest Substring Without Repeating Characters
  10. Daily Interview Problem: Jump to the End

评论 (0)

    当前页暂时没有评论。


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