码迷,mamicode.com
首页 >  
搜索关键字:oj    ( 4253个结果
[LeetCode]70 Climbing Stairs
https://oj.leetcode.com/problems/climbing-stairs/http://blog.csdn.net/linhuanmars/article/details/23976963publicclassSolution{ publicintclimbStairs(intn) { //Arecursivesolution //if(n==1||n==2) //{ //return1; //} //returnclimbStairs(n-1)+climbStairs(n-2); ..
分类:其他好文   时间:2015-01-04 19:45:15    阅读次数:147
[LeetCode]69 Sqrt(x)
https://oj.leetcode.com/problems/sqrtx/http://blog.csdn.net/linhuanmars/article/details/20089131publicclassSolution{ publicintsqrt(intx){ //Assumex>=0 if(x==0) return0; returns(x,0L,(long)x); } privateintcalc(intx,longlow,longhigh) { //Whyusinglong. /..
分类:其他好文   时间:2015-01-04 19:44:12    阅读次数:143
[LeetCode]71 Simplify Path
https://oj.leetcode.com/problems/simplify-path/http://blog.csdn.net/linhuanmars/article/details/23972563publicclassSolution{ publicStringsimplifyPath(Stringpath){ if(path==null) returnnull; String[]paths=path.split("/"); Stack<String>stack=newStack&..
分类:其他好文   时间:2015-01-04 19:43:47    阅读次数:182
[LeetCode]72 Edit Distance
https://oj.leetcode.com/problems/edit-distance/http://blog.csdn.net/linhuanmars/article/details/24213795publicclassSolution{ publicintminDistance(Stringword1,Stringword2) { if(word1==null||word2==null) return-1; if(word1.isEmpty()) returnword2.length();//I..
分类:其他好文   时间:2015-01-04 19:40:46    阅读次数:148
[LeetCode]73 Set Matrix Zeroes
https://oj.leetcode.com/problems/set-matrix-zeroes/http://blog.csdn.net/linhuanmars/article/details/24066199publicclassSolution{ publicvoidsetZeroes(int[][]matrix) { //SolutionA: //setZeroes_NoExtraSpace(matrix); //SolutionB: setZeroes_ExtraRowAndCol(matri..
分类:其他好文   时间:2015-01-04 19:40:25    阅读次数:194
[LeetCode]75 Sort Colors
https://oj.leetcode.com/problems/sort-colors/http://blog.csdn.net/linhuanmars/article/details/24286349publicclassSolution{ publicvoidsortColors(int[]A) { //SolutionA: sortColors_CountColor(A); //SolutionB: //sortColors_MergeSort(A,0,A.length-1); } ///////..
分类:其他好文   时间:2015-01-04 19:37:46    阅读次数:167
[LeetCode]74 Search a 2D Matrix
https://oj.leetcode.com/problems/search-a-2d-matrix/http://blog.csdn.net/linhuanmars/article/details/24216235publicclassSolution{ publicbooleansearchMatrix(int[][]matrix,inttarget){ //Searchfromrightcorner intn=matrix.length;//howmanyrows. intm=matrix[0].le..
分类:其他好文   时间:2015-01-04 19:37:46    阅读次数:131
[LeetCode]78 Subsets
https://oj.leetcode.com/problems/subsets/http://blog.csdn.net/linhuanmars/article/details/24286377publicclassSolution{ publicList<List<Integer>>subsets(int[]S){ Arrays.sort(S); List<List<Integer>>results=newArrayList<>(); hel..
分类:其他好文   时间:2015-01-04 19:35:38    阅读次数:146
[LeetCode]77 Combinations
https://oj.leetcode.com/problems/combinations/http://blog.csdn.net/linhuanmars/article/details/21260217publicclassSolution{ publicList<List<Integer>>combine(intn,intk) { List<List<Integer>>results=newArrayList<>(); help(n,k,0,n..
分类:其他好文   时间:2015-01-04 19:34:42    阅读次数:125
[LeetCode]78 Subsets
https://oj.leetcode.com/problems/subsets/http://blog.csdn.net/linhuanmars/article/details/24286377publicclassSolution{ publicList<List<Integer>>subsets(int[]S){ Arrays.sort(S); List<List<Integer>>results=newArrayList<>(); hel..
分类:其他好文   时间:2015-01-04 19:34:20    阅读次数:306
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!