2014年7月15日
Leetcode Simplify Path
摘要： Given an absolute path for a file (Unix-style), simplify it.For example,path="/home/", =>"/home"path="/a/./b/../../c/", =>"/c"Corner Cases:Did you con... 阅读全文
posted @ 2014-07-15 22:04 OpenSoucre 阅读(143) 评论(0) 推荐(0)
Leetcode Unique Paths II
摘要： Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space i... 阅读全文
posted @ 2014-07-15 20:40 OpenSoucre 阅读(194) 评论(0) 推荐(0)
Leetcode Minimum Window Substring
摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADOBECODEBA... 阅读全文
posted @ 2014-07-15 12:13 OpenSoucre 阅读(239) 评论(0) 推荐(0)