mirror of
				https://gitee.com/coder-xiaomo/leetcode-problemset
				synced 2025-11-04 19:53:12 +08:00 
			
		
		
		
	add leetcode problem-cn part2
This commit is contained in:
		@@ -0,0 +1,21 @@
 | 
			
		||||
<p>You have an integer matrix representing a plot of land, where the value at that loca­tion represents the height above sea level. A value of zero indicates water. A pond is a region of water connected vertically, horizontally, or diagonally. The size of the pond is the total number of connected water cells. Write a method to compute the sizes of all ponds in the matrix.</p>
 | 
			
		||||
 | 
			
		||||
<p><strong>Example: </strong></p>
 | 
			
		||||
 | 
			
		||||
<pre>
 | 
			
		||||
<strong>Input: </strong>
 | 
			
		||||
[
 | 
			
		||||
  [0,2,1,0],
 | 
			
		||||
  [0,1,0,1],
 | 
			
		||||
  [1,1,0,1],
 | 
			
		||||
  [0,1,0,1]
 | 
			
		||||
]
 | 
			
		||||
<strong>Output: </strong> [1,2,4]
 | 
			
		||||
</pre>
 | 
			
		||||
 | 
			
		||||
<p><strong>Note: </strong></p>
 | 
			
		||||
 | 
			
		||||
<ul>
 | 
			
		||||
	<li><code>0 < len(land) <= 1000</code></li>
 | 
			
		||||
	<li><code>0 < len(land[i]) <= 1000</code></li>
 | 
			
		||||
</ul>
 | 
			
		||||
		Reference in New Issue
	
	Block a user