Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex ...
分类：
其他好文 时间：
2018-06-21 11:53:54
阅读次数：
186
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: ...
分类：
其他好文 时间：
2018-06-18 23:47:35
阅读次数：
230
描述Given a string S, find the longest palindromic substring in S. You may assume that the maximumlength of S is 1000, and there exists one unique longe ...
分类：
其他好文 时间：
2018-06-13 23:42:30
阅读次数：
316
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 contains only ...
分类：
其他好文 时间：
2018-06-13 11:50:28
阅读次数：
166
Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex ...
分类：
其他好文 时间：
2018-06-13 00:15:13
阅读次数：
196
问题描述： 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 ...
分类：
其他好文 时间：
2018-06-12 10:28:27
阅读次数：
204
问题描述： 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 ...
分类：
其他好文 时间：
2018-06-08 10:37:36
阅读次数：
149
Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST. Assume a BST is define ...
分类：
其他好文 时间：
2018-06-06 23:46:20
阅读次数：
214
Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex ...
分类：
其他好文 时间：
2018-06-04 14:39:02
阅读次数：
150
在前一篇 Scala 的参数检查与断言: require, assert, assume 和 ensuring，捉摸 Scala 的断言时提到了 JDK 内置对断言的粗略支持，也就是 assert 语句，并且默认该特性是被关掉，需 -ea 开启。assert object != null;assert object != null : "
分类：
编程语言 时间：
2018-06-03 14:47:55
阅读次数：
192
