Description: 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: ...
分类：
其他好文 时间：
2019-02-10 23:08:13
阅读次数：
232
转自：https://blog.bernd-ruecker.com/why-service-collaboration-needs-choreography-and-orchestration-239c4f9700fa Let’s assume you want to build a simple ...
分类：
其他好文 时间：
2019-02-03 23:27:24
阅读次数：
177
算法描述： Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For exa ...
分类：
其他好文 时间：
2019-02-03 11:08:11
阅读次数：
193
算法描述： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For ex ...
分类：
其他好文 时间：
2019-02-03 10:41:35
阅读次数：
198
算法描述： Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contain ...
分类：
其他好文 时间：
2019-02-02 17:02:41
阅读次数：
149
Given an array of size n, find the majority element. The majority element is the element that appears more than ? n/2 ? times. You may assume that the ...
分类：
其他好文 时间：
2019-01-28 19:21:17
阅读次数：
186
1052 Linked List Sorting （25 分） A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each st ...
分类：
其他好文 时间：
2019-01-27 21:45:35
阅读次数：
142
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: 还是用DP来递归，抓住回 ...
分类：
其他好文 时间：
2019-01-26 21:38:37
阅读次数：
150
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" Output: ...
分类：
其他好文 时间：
2019-01-25 11:34:43
阅读次数：
173
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: 1 class Solu ...
分类：
其他好文 时间：
2019-01-20 15:07:08
阅读次数：
164
