I got this question Yesterday in a online Assesment but not Able to get AC. Is there any way to improve this code?

后端 未结 0 637
难免孤独
难免孤独 2020-12-01 11:19

Given an array of size N and a number K. You need to Partition the array into K non-empty partitions such that the sum of (max-min) in each partition is maximized.

Le

相关标签:
回答
  • 消灭零回复
提交回复
热议问题