algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-05 00:25:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

添加内容

Browse Source
This commit is contained in:
YDZ
2020-08-08 09:17:26 +08:00
parent 5015cc6b7b
commit fdba30f0c4
734 changed files with 4024 additions and 2129 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/0410.Split-Array-Largest-Sum/README.md
View File

@ -1,7 +1,7 @@
# [410. Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)
## 题目:
## 题目
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.