you give integer array num integer k you partition array k nonempty adjacent subarray the score partition sum averages subarrayNote partition use integer num score necessarily integerreturn maximum score achieve possible partition Answers 106 actual answer accept Example 1input num 91239 k 3output 2000000explanation the good choice partition num 9 1 2 3 9 the answer 9 1 2 3 3 9 20we partition num 9 1 2 3 9 examplethat partition lead score 5 2 6 13 worseExample 2input num 1234567 k 4Output 2050000 Constraints1 numslength 1001 numsi 1041 k numslength