Find a subset of length 4 which has a maximum value of sum

前端 未结 0 1338
时光说笑
时光说笑 2020-12-02 01:16

So I need a solution for this example without using queue. For example [1, 5, 7, 2, 11, 3, 6, 15, 1, 5, 0, 7, 6, 3] max sum of 4 elements here is 35 [11, 3, 6, 15]. This is

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