2015 年 6月 17 日随笔档案 - NealCaffrey989

2015年6月17日

摘要： 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-06-17 23:00 NealCaffrey989 阅读(169) 评论(0) 推荐(0)

[LeetCode] #44 Wildcard Matching

摘要： mplement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters (including the em... 阅读全文

posted @ 2015-06-17 22:54 NealCaffrey989 阅读(157) 评论(0) 推荐(0)

[LeetCode] #43 Multiply Strings

摘要： Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega... 阅读全文

posted @ 2015-06-17 16:53 NealCaffrey989 阅读(157) 评论(0) 推荐(0)

[LeetCode] #42 Trapping Rain Water

摘要： Givennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.Fo... 阅读全文

posted @ 2015-06-17 16:38 NealCaffrey989 阅读(142) 评论(0) 推荐(0)

[LeetCode] #41 First Missing Positive

摘要： Given an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]return2.Your algorithm should ru... 阅读全文

posted @ 2015-06-17 16:30 NealCaffrey989 阅读(137) 评论(0) 推荐(0)