Commit 748dfb8

committed

refactor solutions to container_with_most_water

1 parent 1d5bd93 commit 748dfb8Copy full SHA for 748dfb8

File tree

-15

lines changed

-15

lines changed

Lines changed: 5 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,24 +14,18 @@ MaxArea solves the following problem:`
`14`	`14`	`*/`
`15`	`15`	`func MaxArea(height []int) int {`
`16`	`16`	`var (`
`17`		`- i, j = 0, len(height) - 1`
`18`		`- max = 0`
	`17`	`+ i, j = 0, len(height) - 1`
	`18`	`+ maxArea = 0`
`19`	`19`	`)`
`20`	`20`	`for j-i > 0 {`
	`21`	`+ area := min(height[i], height[j]) * (j - i)`
	`22`	`+ maxArea = max(maxArea, area)`
`21`	`23`	`if height[j] < height[i] {`
`22`		`- area := height[j] * (j - i)`
`23`		`- if max < area {`
`24`		`- max = area`
`25`		`- }`
`26`	`24`	`j--`
`27`	`25`	`} else {`
`28`		`- area := height[i] * (j - i)`
`29`		`- if max < area {`
`30`		`- max = area`
`31`		`- }`
`32`	`26`	`i++`
`33`	`27`	`}`
`34`	`28`	`}`
`35`	`29`
`36`		`- return max`
	`30`	`+ return maxArea`
`37`	`31`	`}`

Lines changed: 2 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -232,13 +232,11 @@ impl Solution {`
`232`	`232`	`let mut max_area = 0;`
`233`	`233`
`234`	`234`	`while j > i {`
	`235`	`+ let area = height[i].min(height[j]) * (j - i) as i32;`
	`236`	`+ max_area = max_area.max(area);`
`235`	`237`	`if height[i] > height[j] {`
`236`		`- let area = height[j] * (j - i) as i32;`
`237`		`- max_area = max_area.max(area);`
`238`	`238`	`j -= 1;`
`239`	`239`	`} else {`
`240`		`- let area = height[i] * (j - i) as i32;`
`241`		`- max_area = max_area.max(area);`
`242`	`240`	`i += 1;`
`243`	`241`	`}`
`244`	`242`	`}`

Comments

(0)