2014 年 10月 8 日随笔档案 - neverlandly

2014年10月8日

摘要： Best 做法：不用Extra Space, Time Complexity still O(N^2) Good syntax: // creating Arrays of String type String a[] = new String[] { "A", "B", "C", "D" }; / 阅读全文

posted @ 2014-10-08 13:16 neverlandly 阅读(459) 评论(0) 推荐(0)

Leetcode: Wildcard Matching

摘要：想法是建立一个2维的boolean数组，booleen[][] check = new boolean[s.length()+1][p.length()+1]，注意最好比string的length大一行和一列，来包括第0行和第0列的情况。这样初始化比较方便。check[m][n]表示s的前m个元素是阅读全文

posted @ 2014-10-08 10:36 neverlandly 阅读(651) 评论(0) 推荐(0)

Leetcode: Edit Distance

摘要： Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have t... 阅读全文

posted @ 2014-10-08 06:10 neverlandly 阅读(744) 评论(0) 推荐(0)