Commit 9031523

committed

添加 0053.最大子序和.md Scala版本

1 parent bd4f69d commit 9031523Copy full SHA for 9031523

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -333,8 +333,41 @@ function maxSubArray(nums: number[]): number {`
`333`	`333`	`};`
`334`	`334`	```
`335`	`335`
	`336`	`+### Scala`
`336`	`337`
	`338`	`+贪心`
	`339`	`+`
	`340`	+```scala
	`341`	`+object Solution {`
	`342`	`+ def maxSubArray(nums: Array[Int]): Int = {`
	`343`	`+ var result = Int.MinValue`
	`344`	`+ var count = 0`
	`345`	`+ for (i <- nums.indices) {`
	`346`	`+ count += nums(i) // count累加`
	`347`	`+ if (count > result) result = count // 记录最大值`
	`348`	`+ if (count <= 0) count = 0 // 一旦count为负,则count归0`
	`349`	`+ }`
	`350`	`+ result`
	`351`	`+ }`
	`352`	`+}`
	`353`	+```
`337`	`354`
	`355`	`+动态规划`
	`356`	`+`
	`357`	+```scala
	`358`	`+object Solution {`
	`359`	`+ def maxSubArray(nums: Array[Int]): Int = {`
	`360`	`+ var dp = new Array[Int](nums.length)`
	`361`	`+ var result = nums(0)`
	`362`	`+ dp(0) = nums(0)`
	`363`	`+ for (i <- 1 until nums.length) {`
	`364`	`+ dp(i) = math.max(nums(i), dp(i - 1) + nums(i))`
	`365`	`+ result = math.max(result, dp(i)) // 更新最大值`
	`366`	`+ }`
	`367`	`+ result`
	`368`	`+ }`
	`369`	`+}`
	`370`	+```
`338`	`371`
`339`	`372`	`-----------------------`
`340`	`373`	`<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>`

Comments

(0)