2022/05/03 글 목록

728x90

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an array nums 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. Example 1: Input: nums = [7,2,5,10,8], m = 2 Output: 18 Explanation: There are four ways to split nums into two subarrays. The best way is to split ..

Algorithm/LeetCode Daily Challenge 2022. 5. 3. 10:30

728x90