Commit 42d042f

committed

Time: 1520 ms (71.71%), Space: 50.3 MB (74.63%) - LeetHub

1 parent 9f8aa3c commit 42d042fCopy full SHA for 42d042f

File tree

+28

-0

lines changed

+28

-0

lines changed

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,28 @@`
	`1`	`+class Solution:`
	`2`	`+ def maxPoints(self, points: List[List[int]]) -> int:`
	`3`	`+ m, n = len(points), len(points[0])`
	`4`	`+`
	`5`	`+ # Initialize the dp array with the first row of points`
	`6`	`+ dp = points[0]`
	`7`	`+`
	`8`	`+ # Process each row`
	`9`	`+ for i in range(1, m):`
	`10`	`+ left_max = [0] * n`
	`11`	`+ right_max = [0] * n`
	`12`	`+`
	`13`	`+ # Compute the left max values`
	`14`	`+ left_max[0] = dp[0]`
	`15`	`+ for j in range(1, n):`
	`16`	`+ left_max[j] = max(left_max[j-1] - 1, dp[j])`
	`17`	`+`
	`18`	`+ # Compute the right max values`
	`19`	`+ right_max[n-1] = dp[n-1]`
	`20`	`+ for j in range(n-2, -1, -1):`
	`21`	`+ right_max[j] = max(right_max[j+1] - 1, dp[j])`
	`22`	`+`
	`23`	`+ # Update dp for the current row`
	`24`	`+ for j in range(n):`
	`25`	`+ dp[j] = points[i][j] + max(left_max[j], right_max[j])`
	`26`	`+`
	`27`	`+ # The maximum value in dp array is the result`
	`28`	`+ return max(dp)`

Comments

(0)