上一页 1 ··· 18 19 20 21 22 23 24 25 26 ··· 28 下一页
摘要: Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word ... 阅读全文
posted @ 2015-05-15 19:44 TonyLuis 阅读(161) 评论(0) 推荐(0) 编辑
摘要: Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initial... 阅读全文
posted @ 2015-05-15 19:23 TonyLuis 阅读(198) 评论(0) 推荐(0) 编辑
摘要: Given a collection of intervals, merge all overlapping intervals. For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].解题思路一:用两个指针... 阅读全文
posted @ 2015-05-15 18:06 TonyLuis 阅读(237) 评论(0) 推荐(0) 编辑
摘要: Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu... 阅读全文
posted @ 2015-05-15 11:05 TonyLuis 阅读(118) 评论(0) 推荐(0) 编辑
摘要: Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example,Given the following matrix:[ [ 1,... 阅读全文
posted @ 2015-05-15 10:53 TonyLuis 阅读(155) 评论(0) 推荐(0) 编辑
摘要: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,... 阅读全文
posted @ 2015-05-15 10:10 TonyLuis 阅读(143) 评论(0) 推荐(0) 编辑
摘要: Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.解题思路:和上题一样《JAVA语言程序设计》中exer... 阅读全文
posted @ 2015-05-15 09:47 TonyLuis 阅读(136) 评论(0) 推荐(0) 编辑
摘要: Given an integer n, return all distinct solutions to the n-queens puzzle.Each solution contains a distinct board configuration of the n-queens' placem... 阅读全文
posted @ 2015-05-15 09:43 TonyLuis 阅读(167) 评论(0) 推荐(0) 编辑
摘要: Implement pow(x, n).解题思路:直接使用乘法实现即可,注意下,如果n很大的话,递归次数会太多,因此在n=10和n=-10的地方设置一个检查点,JAVA实现如下:static public double myPow(double x, int n) { if(n==1)... 阅读全文
posted @ 2015-05-14 23:39 TonyLuis 阅读(203) 评论(0) 推荐(0) 编辑
摘要: Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.解题思路:首先要理解,什么是anagrams,ie。“tea”、“tae”... 阅读全文
posted @ 2015-05-14 23:23 TonyLuis 阅读(116) 评论(0) 推荐(0) 编辑
上一页 1 ··· 18 19 20 21 22 23 24 25 26 ··· 28 下一页