09 2014 档案

[Leetcode] Longest Palindromic Substring
摘要：Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa... 阅读全文
posted @ 2014-09-30 14:23 Phoebe815 阅读(194) 评论(0) 推荐(0)
[Leetcode] Maximum Product Subarray
摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the... 阅读全文
posted @ 2014-09-29 01:00 Phoebe815 阅读(196) 评论(0) 推荐(0)
[leetcode] Permutation Sequence
摘要：The set[1,2,3,…,n]contains a total ofn! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie... 阅读全文
posted @ 2014-09-28 04:14 Phoebe815 阅读(184) 评论(0) 推荐(0)
[Leetcode] Simplify Path
摘要：Given an absolute path for a file (Unix-style), simplify it.For example,path="/home/", =>"/home"path="/a/./b/../../c/", =>"/c"click to show corner cas... 阅读全文
posted @ 2014-09-27 15:25 Phoebe815 阅读(180) 评论(0) 推荐(0)
[Leetcode] Minimum Window Substring
摘要：算法思想：http://www.cnblogs.com/lichen782/p/leetcode_minimum_window_substring_3.html 1 public class Solution { 2 public String minWindow(String S, Str... 阅读全文
posted @ 2014-09-26 11:35 Phoebe815 阅读(192) 评论(0) 推荐(0)
编程中i++与++i的区别
摘要： 阅读全文
posted @ 2014-09-24 01:00 Phoebe815 阅读(243) 评论(0) 推荐(0)
CC150 - 11.6
摘要：Question:Given an M x N matrix in which each row and each column is sorted in ascending order, write a method to find an element. 1 package POJ; 2 3 ... 阅读全文
posted @ 2014-09-01 01:51 Phoebe815 阅读(251) 评论(0) 推荐(0)