756 accepted. 4ms

Author: aQua

Algorithms/0756.pour-water/pour-water.go

@@ -3,23 +3,41 @@ package Problem0756
 func pourWater(heights []int, V int, K int) []int {
 	for V > 0 {
 		V--
-		drop(heights, K, heights[K]+1, true, true)
+		if !isDroppedLeft(heights, K) && !isDroppedRight(heights, K) {
+			heights[K]++
+		}
 	}
 	return heights
 }
 
-func drop(h []int, i, j int, l, r bool) bool {
-	if l && i > 0 && h[i-1] <= h[i] && drop(h, i-1, h[i], l, false) {
-		return true
+func isDroppedLeft(heights []int, center int) bool {
+	idx := center
+	i := center
+	for 0 <= i-1 && heights[i-1] <= heights[i] {
+		if heights[i-1] < heights[i] {
+			idx = i - 1
+		}
+		i--
 	}
-	if r && i < len(h)-1 && h[i+1] <= h[i] && drop(h, i+1, h[i], false, r) {
+	if idx < center {
+		heights[idx]++
 		return true
 	}
+	return false
+}
 
-	if h[i] == j {
-		return false
+func isDroppedRight(heights []int, center int) bool {
+	idx := center
+	i := center
+	for i+1 < len(heights) && heights[i] >= heights[i+1] {
+		if heights[i] > heights[i+1] {
+			idx = i + 1
+		}
+		i++
 	}
-
-	h[i]++
-	return true
+	if center < idx {
+		heights[idx]++
+		return true
+	}
+	return false
 }