随笔档案「2016年1月」 - Weizheng_Love_Coding

[LeetCode]Wildcard Matching

摘要：public class Solution { public boolean isMatch(String s, String p) { int length1 = s.length(); int length2 = p.length(); if (l... 阅读全文

posted @ 2016-01-10 15:52 Weizheng_Love_Coding 阅读(92) 评论(0) 推荐(0)

摘要：public class Solution { public boolean isMatch(String s, String p) { if (p.length() == 0) { return s.length() == 0; } ... 阅读全文

posted @ 2016-01-10 15:52 Weizheng_Love_Coding 阅读(134) 评论(0) 推荐(0)

摘要：O(n)时间空间复杂度public class Solution { public int maxSubArrayLen(int[] nums, int k) { HashMap map = new HashMap(); int sum = 0; in... 阅读全文

posted @ 2016-01-05 15:31 Weizheng_Love_Coding 阅读(216) 评论(0) 推荐(0)

摘要：感觉我的方法逻辑不够清晰public class Solution { private List result; public List generateAbbreviations(String word) { result = new ArrayList(); ... 阅读全文

posted @ 2016-01-03 23:08 Weizheng_Love_Coding 阅读(167) 评论(0) 推荐(0)

Vision_World