Longest Palindromic SubstringGiven a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there...
分类：
其他好文 时间：
2014-08-01 04:47:25
阅读次数：
243
Single NumberGiven an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runti...
分类：
其他好文 时间：
2014-08-01 04:44:31
阅读次数：
189
题目还原
Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up t...
分类：
其他好文 时间：
2014-08-01 02:25:11
阅读次数：
391
题目：Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "ad....
分类：
编程语言 时间：
2014-08-01 02:20:41
阅读次数：
236
Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters. For example, the ...
分类：
其他好文 时间：
2014-07-31 23:46:00
阅读次数：
256
Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings.算法思路：思路：貌似木有什么捷径，逐个比较，遇到不同即断开。代码如下： 1 publi...
分类：
其他好文 时间：
2014-07-31 23:31:50
阅读次数：
231
Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root ...
分类：
其他好文 时间：
2014-07-31 23:19:10
阅读次数：
259
Path Sum IIGiven a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tr...
分类：
其他好文 时间：
2014-07-31 23:17:10
阅读次数：
175
Problem Description:
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they...
分类：
其他好文 时间：
2014-07-31 20:48:17
阅读次数：
215
.find('classname')//在里面找类名为——的元素.eq(i)//元素的第i个.parent()//父元素.child()//子元素$.each(element,function(i,val){});//遍历元素中的每个并且添加操作.removeClass('className')/....
分类：
Web程序 时间：
2014-07-31 20:17:17
阅读次数：
232
