| | | | |

2016年6月21日

摘要： Given n non-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. 阅读全文

posted @ 2016-06-21 18:00 xiaoba1203 阅读(169) 评论(0) 推荐(0) 编辑

leetcode 41 First Missing Positive ---java

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

posted @ 2016-06-21 15:35 xiaoba1203 阅读(137) 评论(0) 推荐(0) 编辑

2016年6月21日

公告