题目:Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique lon...
分类:
其他好文 时间:
2015-12-09 17:18:01
阅读次数:
115
Given an array of sizen, find the majority element. The majority element is the element that appears more than? n/2 ?times.class Solution {public: int...
分类:
其他好文 时间:
2015-12-09 17:16:36
阅读次数:
171
百度google了一大圈没找到中文答案,无奈之下硬着头皮看了一个英文答案http://stackoverflow.com/questions/11502703/eclipse-can-not-find-the-tag-directoryYou have to include/add standard...
分类:
Web程序 时间:
2015-12-09 17:08:59
阅读次数:
800
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类:
其他好文 时间:
2015-12-09 17:06:30
阅读次数:
108
问题描述:Given an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a linear runtime...
分类:
编程语言 时间:
2015-12-09 13:45:34
阅读次数:
152
var _ =peopleslive.h5; _.main=function(){ //集赞排名1 $('#tab1 .tab_nav').find('li').click (function() { tabPage($('#tab1'),$(...
分类:
其他好文 时间:
2015-12-09 13:38:07
阅读次数:
311
问题描述:Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime compl...
分类:
编程语言 时间:
2015-12-09 11:28:28
阅读次数:
160
并差集是一个非常普通的模板,其中find函数为:find(int x){if(father[x]==x)return x;return find(father[x]);}但是今天发现了一个新的模板:int finds(int x){while(father[x]!=x)x=father[x];ret...
分类:
其他好文 时间:
2015-12-09 07:10:01
阅读次数:
120
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.求出0,1矩阵中的最大矩形区域:DP问题,可以使用数组记下当前行位...
分类:
其他好文 时间:
2015-12-08 23:48:48
阅读次数:
203
十进制转度分秒=TEXT(INT(A1),"0")&"°"&TEXT(INT((A1-INT(A1))*60),"00")&"′"&TEXT(((A1-INT(A1))*60-INT((A1-INT(A1))*60))*60,"00.00")&"″"度分秒转十进制=LEFT(A2,FIND("°",...
分类:
其他好文 时间:
2015-12-08 18:33:31
阅读次数:
602