bioreactor-public/leetcode
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

"Maximum Fruits Harvested After at Most K Steps" accepted solution

Browse Source
This commit is contained in:
Rostislav Kuratch
2022-06-06 22:06:59 +03:00
parent d6d554064c
commit e3193bd1bb
2 changed files with 21 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
2106-max-fruits-harvested-in-k-steps.go
View File

@@ -5,6 +5,9 @@ func MaxTotalFruits(fruits [][]int, startPos int, k int) int {
return 0 return 0
} }
//fmt.Println("startPos = ", startPos)
//fmt.Println("steps(k) = ", k)
totalLength := fruits[len(fruits)-1][0] + 1 totalLength := fruits[len(fruits)-1][0] + 1
//fmt.Println("totalLength = ", totalLength) //fmt.Println("totalLength = ", totalLength)
@@ -56,11 +59,16 @@ func MaxTotalFruits(fruits [][]int, startPos int, k int) int {
maxFruits := calcFruitySliceSum(startPos, rightLimit) maxFruits := calcFruitySliceSum(startPos, rightLimit)
windowBegin := startPos - (k - windowSize*2) // in case number of steps cannot be fully divided by 2, start position is shifted 1 position to the left delta := k - windowSize*2
windowEnd := windowBegin + windowSize + (k - windowSize*2) // for odd numbers of k we need to adjust wnd sz +1 windowBegin :=
startPos - delta // in case number of steps cannot be fully divided by 2, start position is shifted 1 position to the left
windowEnd :=
windowBegin + windowSize + (k - windowSize*2) // for odd numbers of k we need to adjust wnd sz +1
if windowEnd >= rightLimit { if windowEnd > rightLimit {
windowBegin -= 2 * (windowEnd - rightLimit)
windowEnd = rightLimit windowEnd = rightLimit
windowSize = windowEnd - windowBegin - (k - windowSize*2)
} }
endCycle := false endCycle := false
@@ -77,7 +85,7 @@ func MaxTotalFruits(fruits [][]int, startPos int, k int) int {
windowSize++ windowSize++
windowEnd-- windowEnd--
windowBegin = windowEnd - windowSize windowBegin = windowEnd - windowSize - delta
} }
alternativeMaxFruits := calcFruitySliceSum(leftLimit, startPos) alternativeMaxFruits := calcFruitySliceSum(leftLimit, startPos)
@@ -89,8 +97,10 @@ func MaxTotalFruits(fruits [][]int, startPos int, k int) int {
windowEnd = startPos + (k - windowSize*2) windowEnd = startPos + (k - windowSize*2)
windowBegin = windowEnd - windowSize - (k - windowSize*2) windowBegin = windowEnd - windowSize - (k - windowSize*2)
if windowBegin <= leftLimit { if windowBegin < leftLimit {
windowEnd += 2 * (leftLimit - windowBegin)
windowBegin = leftLimit windowBegin = leftLimit
windowSize = windowEnd - (k - windowSize*2) - windowBegin
} }
endCycle = false endCycle = false
@@ -107,7 +117,7 @@ func MaxTotalFruits(fruits [][]int, startPos int, k int) int {
windowSize++ windowSize++
windowBegin++ windowBegin++
windowEnd = windowBegin + windowSize windowEnd = windowBegin + windowSize + delta
} }
return maxFruits return maxFruits

7
2106-max-fruits-harvested-in-k-steps_test.go
View File

@@ -7,10 +7,13 @@ import (
func TestMaxTotalFruits(t *testing.T) { func TestMaxTotalFruits(t *testing.T) {
/*assert.Equal(t, 9, MaxTotalFruits([][]int{{2, 8}, {6, 3}, {8, 6}}, 5, 4)) assert.Equal(t, 9, MaxTotalFruits([][]int{{2, 8}, {6, 3}, {8, 6}}, 5, 4))
assert.Equal(t, 14, MaxTotalFruits([][]int{{0, 9}, {4, 1}, {5, 7}, {6, 2}, {7, 4}, {10, 9}}, 5, 4)) assert.Equal(t, 14, MaxTotalFruits([][]int{{0, 9}, {4, 1}, {5, 7}, {6, 2}, {7, 4}, {10, 9}}, 5, 4))
assert.Equal(t, 0, MaxTotalFruits([][]int{{0, 3}, {6, 4}, {8, 5}}, 3, 2)) assert.Equal(t, 0, MaxTotalFruits([][]int{{0, 3}, {6, 4}, {8, 5}}, 3, 2))
assert.Equal(t, 10000, MaxTotalFruits([][]int{{0, 10000}}, 200000, 200000)) assert.Equal(t, 10000, MaxTotalFruits([][]int{{0, 10000}}, 200000, 200000))
assert.Equal(t, 10000, MaxTotalFruits([][]int{{200000, 10000}}, 0, 200000))*/ assert.Equal(t, 10000, MaxTotalFruits([][]int{{200000, 10000}}, 0, 200000))
assert.Equal(t, 22, MaxTotalFruits([][]int{{1, 9}, {2, 10}, {3, 1}, {5, 6}, {6, 3}, {8, 2}, {9, 2}, {11, 4}, {18, 10}, {22, 8}, {25, 2}, {26, 2}, {30, 4}, {31, 5}, {33, 9}, {34, 1}, {39, 10}}, 19, 9)) assert.Equal(t, 22, MaxTotalFruits([][]int{{1, 9}, {2, 10}, {3, 1}, {5, 6}, {6, 3}, {8, 2}, {9, 2}, {11, 4}, {18, 10}, {22, 8}, {25, 2}, {26, 2}, {30, 4}, {31, 5}, {33, 9}, {34, 1}, {39, 10}}, 19, 9))
assert.Equal(t, 22, MaxTotalFruits([][]int{{0, 10}, {5, 1}, {6, 9}, {8, 5}, {9, 4}, {13, 2}, {14, 2}, {17, 8}, {21, 10}, {28, 4}, {30, 2}, {31, 2}, {33, 3}, {34, 6}, {36, 1}, {37, 10}, {38, 9}}, 20, 9))
assert.Equal(t, 43, MaxTotalFruits([][]int{{3, 10}, {8, 6}, {11, 8}, {16, 5}, {17, 1}, {19, 2}, {24, 4}, {29, 4}, {30, 8}, {31, 1}, {33, 2}, {34, 9}, {35, 9}, {40, 10}}, 39, 13))
assert.Equal(t, 128, MaxTotalFruits([][]int{{0, 6}, {2, 2}, {6, 7}, {9, 8}, {10, 10}, {12, 5}, {13, 5}, {14, 5}, {15, 6}, {18, 10}, {19, 7}, {20, 5}, {21, 8}, {23, 10}, {24, 8}, {29, 3}, {32, 9}, {34, 5}, {35, 7}, {37, 10}}, 9, 36))
} }