Commit 94038c1a by ASAHI OCEAN Committed by GitHub

parent 82b89d1e
 ## 1488. Avoid Flood in The City ### [Gist with solution](https://gist.github.com/asahiocean/60869ea4465a3557f844f26d96f3b011) • [Open Problem](https://leetcode.com/problems/avoid-flood-in-the-city/) • [Discuss](https://vk.cc/c4akh5) ### [Open Problem](https://leetcode.com/problems/avoid-flood-in-the-city/) • [Discuss](https://vk.cc/c4akh5) • [Gist with solution](https://gist.github.com/asahiocean/60869ea4465a3557f844f26d96f3b011) -------

Your country has an infinite number of lakes. Initially, all the lakes are empty, but when it rains over the nth lake, the nth lake becomes full of water. If it rains over a lake which is full of water, there will be a flood. Your goal is to avoid the flood in any lake.

Given an integer array rains where:

... ... @@ -77,4 +83,4 @@ After that, it will rain over lakes [1,2]. It's easy to prove that no matter whi
• 1 <= rains.length <= 105
• 0 <= rains[i] <= 109
• \ No newline at end of file
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!