From 79b879c6878c3c8905e1ae4ef295827872d31264 Mon Sep 17 00:00:00 2001 From: GreyZeng <410486047@qq.com> Date: Fri, 16 Dec 2022 08:29:46 +0800 Subject: [PATCH] trapping rain water --- .../LeetCode_0042_TrappingRainWater.java" | 2 +- .../LeetCode_0407_TrappingRainWaterII.java" | 3 ++- 2 files changed, 3 insertions(+), 2 deletions(-) rename "src/main/java/\347\273\203\344\271\240\351\242\230/leetcode/hard/LeetCode_0042_TrappingRainWater.java" => "src/main/java/\347\273\203\344\271\240\351\242\230/\346\216\245\351\233\250\346\260\264\347\263\273\345\210\227\351\227\256\351\242\230/LeetCode_0042_TrappingRainWater.java" (96%) rename "src/main/java/\347\273\203\344\271\240\351\242\230/leetcode/hard/LeetCode_0407_TrappingRainWaterII.java" => "src/main/java/\347\273\203\344\271\240\351\242\230/\346\216\245\351\233\250\346\260\264\347\263\273\345\210\227\351\227\256\351\242\230/LeetCode_0407_TrappingRainWaterII.java" (98%) diff --git "a/src/main/java/\347\273\203\344\271\240\351\242\230/leetcode/hard/LeetCode_0042_TrappingRainWater.java" "b/src/main/java/\347\273\203\344\271\240\351\242\230/\346\216\245\351\233\250\346\260\264\347\263\273\345\210\227\351\227\256\351\242\230/LeetCode_0042_TrappingRainWater.java" similarity index 96% rename from "src/main/java/\347\273\203\344\271\240\351\242\230/leetcode/hard/LeetCode_0042_TrappingRainWater.java" rename to "src/main/java/\347\273\203\344\271\240\351\242\230/\346\216\245\351\233\250\346\260\264\347\263\273\345\210\227\351\227\256\351\242\230/LeetCode_0042_TrappingRainWater.java" index fff9b0a4..22db4564 100644 --- "a/src/main/java/\347\273\203\344\271\240\351\242\230/leetcode/hard/LeetCode_0042_TrappingRainWater.java" +++ "b/src/main/java/\347\273\203\344\271\240\351\242\230/\346\216\245\351\233\250\346\260\264\347\263\273\345\210\227\351\227\256\351\242\230/LeetCode_0042_TrappingRainWater.java" @@ -1,4 +1,4 @@ -package 练习题.leetcode.hard; +package 练习题.接雨水系列问题; //给定 n 个非负整数表示每个宽度为 1 的柱子的高度图,计算按此排列的柱子,下雨之后能接多少雨水 // Leetcode题目:https://leetcode.com/problems/trapping-rain-water/ diff --git "a/src/main/java/\347\273\203\344\271\240\351\242\230/leetcode/hard/LeetCode_0407_TrappingRainWaterII.java" "b/src/main/java/\347\273\203\344\271\240\351\242\230/\346\216\245\351\233\250\346\260\264\347\263\273\345\210\227\351\227\256\351\242\230/LeetCode_0407_TrappingRainWaterII.java" similarity index 98% rename from "src/main/java/\347\273\203\344\271\240\351\242\230/leetcode/hard/LeetCode_0407_TrappingRainWaterII.java" rename to "src/main/java/\347\273\203\344\271\240\351\242\230/\346\216\245\351\233\250\346\260\264\347\263\273\345\210\227\351\227\256\351\242\230/LeetCode_0407_TrappingRainWaterII.java" index 7c7cc7d1..8fa7e55c 100644 --- "a/src/main/java/\347\273\203\344\271\240\351\242\230/leetcode/hard/LeetCode_0407_TrappingRainWaterII.java" +++ "b/src/main/java/\347\273\203\344\271\240\351\242\230/\346\216\245\351\233\250\346\260\264\347\263\273\345\210\227\351\227\256\351\242\230/LeetCode_0407_TrappingRainWaterII.java" @@ -1,7 +1,8 @@ -package 练习题.leetcode.hard; +package 练习题.接雨水系列问题; import java.util.Comparator; import java.util.PriorityQueue; + //给你一个 m x n 的矩阵,其中的值均为非负整数,代表二维高度图每个单元的高度,请计算图中形状最多能接多少体积的雨水。 // Leetcode题目:https://leetcode.com/problems/trapping-rain-water-ii/ //Constraints: -- GitLab