Find 2 MINIMUM sub arrays that their sum is equal or greater than k

后端 未结 0 732
执念已碎
执念已碎 2021-01-02 01:25

What algorithm should i use to solve this or what is the logic behind solving this, an optimal solution, not brute force. I want the idea of how to solve this and maybe the

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