D. Water Tree Mad scientist Mike has constructed a rooted tree, which consists of n vertices. Each vertex is a reservoir which can be either empty or
分类：
其他好文 时间：
2016-03-11 22:12:47
阅读次数：
259
42. Trapping Rain Water Problem's Link ---------------------------------------------------------------------------- Mean: 在坐标上给你一些竖直放置的条形积木，问你这个积木能够容纳
分类：
移动开发 时间：
2016-03-06 12:54:30
阅读次数：
196
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.
分类：
移动开发 时间：
2016-03-06 01:15:07
阅读次数：
274
shutdown immediate 经常关库时hang住,在alert中有 License high water mark = 4All dispatchers and shared servers shutdown 多等一会会出现SHUTDOWN: Active processes preven
分类：
其他好文 时间：
2016-02-26 23:39:45
阅读次数：
1016
一开始暴力解决，时间没通过 1 class Solution { 2 public: 3 int maxArea(vector<int>& height) { 4 int maxArea=0,eachArea=0; 5 if(height.size()<2) return maxArea; 6 fo
分类：
其他好文 时间：
2016-02-24 22:41:01
阅读次数：
241
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen
分类：
其他好文 时间：
2016-02-23 11:17:07
阅读次数：
211
原题链接在这里：https://leetcode.com/problems/number-of-islands-ii/ A 2d grid map of m rows and n columns is initially filled with water. We may perform an ad
分类：
其他好文 时间：
2016-02-21 10:13:17
阅读次数：
239
A 2d grid map of m rows and n columns is initially filled with water. We may perform an addLand operation which turns the water at position (row, col)
分类：
其他好文 时间：
2016-02-15 14:55:43
阅读次数：
532
LeetCode传送门 https://leetcode.com/problems/trapping-rain-water/ 目标：找出积木能容纳的水的“面积”，如图中黑色部分是积木，蓝色为可容纳水的部分 假设：积木宽度均为1 输入：各个积木的高度 输出：所有积木能容纳水的“面积” 思考过程 1.
分类：
移动开发 时间：
2016-02-08 17:23:56
阅读次数：
253
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.
分类：
移动开发 时间：
2016-02-06 10:25:43
阅读次数：
189
