2019年8月22日
5. Longest Palindromic Substring
摘要： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Example 2: 阅读全文
posted @ 2019-08-22 23:05 Schwifty 阅读(125) 评论(0) 推荐(0)
234. Palindrome Linked List
摘要： Given a singly linked list, determine if it is a palindrome. Example 1: Example 2: Follow up:Could you do it in O(n) time and O(1) space? findmiddle返回 阅读全文
posted @ 2019-08-22 04:48 Schwifty 阅读(131) 评论(0) 推荐(0)
143. Reorder List
摘要： Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You may not modify the values in the list's nodes, only nodes its 阅读全文
posted @ 2019-08-22 04:21 Schwifty 阅读(144) 评论(0) 推荐(0)
142. Linked List Cycle II
摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, return null. To represent a cycle in the given linked list, we use 阅读全文
posted @ 2019-08-22 02:09 Schwifty 阅读(148) 评论(0) 推荐(0)