https://blog.youkuaiyun.com/m0_73617263zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/m0_73617263/article/details/146191358https://blog.youkuaiyun.com/m0_73617263/article/details/146191358m0_73617263Tue, 11 Mar 2025 22:54:05 +0800=0, A<0, B>0, 所以B>-A, 走完一圈的B+A>=0。假设在[0,i]存在一个下标j，使得[j,i]的累加和大于0，由于[0,i]的累加和小于0，则[0,j]的累加和一定小于0，那么其实就会从j重新开始作为起始位置了。]]>https://blog.youkuaiyun.com/m0_73617263/article/details/146138688https://blog.youkuaiyun.com/m0_73617263/article/details/146138688m0_73617263Sun, 09 Mar 2025 21:01:32 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/146137452https://blog.youkuaiyun.com/m0_73617263/article/details/146137452m0_73617263Sun, 09 Mar 2025 19:47:18 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/146023225https://blog.youkuaiyun.com/m0_73617263/article/details/146023225m0_73617263Tue, 04 Mar 2025 18:06:45 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/146000637https://blog.youkuaiyun.com/m0_73617263/article/details/146000637m0_73617263Mon, 03 Mar 2025 21:54:28 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145969911https://blog.youkuaiyun.com/m0_73617263/article/details/145969911m0_73617263Sun, 02 Mar 2025 20:55:34 +0800target而直接返回。去重的逻辑（自己想的）：通过画树辅助分析，在回溯的时候，弹出去的元素，与下一层循环要加进来的元素不能相等，这样答案就不会重复（当然最一开始先对数组进行排序）用一个bool数组来定义每个下标的元素是否使用过，我们要去重的维度是树层，而树枝上可以有重复元素（实质上是不同下标但数值相同的元素）个人觉得自己的思路更好理解。]]>https://blog.youkuaiyun.com/m0_73617263/article/details/145955395https://blog.youkuaiyun.com/m0_73617263/article/details/145955395m0_73617263Sat, 01 Mar 2025 22:53:35 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145799520https://blog.youkuaiyun.com/m0_73617263/article/details/145799520m0_73617263Sat, 22 Feb 2025 19:28:27 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145797687https://blog.youkuaiyun.com/m0_73617263/article/details/145797687m0_73617263Sat, 22 Feb 2025 17:05:25 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145795882https://blog.youkuaiyun.com/m0_73617263/article/details/145795882m0_73617263Sat, 22 Feb 2025 15:28:14 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145714539https://blog.youkuaiyun.com/m0_73617263/article/details/145714539m0_73617263Tue, 18 Feb 2025 20:50:52 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145707913https://blog.youkuaiyun.com/m0_73617263/article/details/145707913m0_73617263Tue, 18 Feb 2025 15:51:34 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145577325https://blog.youkuaiyun.com/m0_73617263/article/details/145577325m0_73617263Tue, 11 Feb 2025 18:08:52 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145573681https://blog.youkuaiyun.com/m0_73617263/article/details/145573681m0_73617263Tue, 11 Feb 2025 15:48:56 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145553663https://blog.youkuaiyun.com/m0_73617263/article/details/145553663m0_73617263Mon, 10 Feb 2025 16:50:46 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145522209https://blog.youkuaiyun.com/m0_73617263/article/details/145522209m0_73617263Sat, 08 Feb 2025 20:10:49 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145498011https://blog.youkuaiyun.com/m0_73617263/article/details/145498011m0_73617263Fri, 07 Feb 2025 16:37:25 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145461548https://blog.youkuaiyun.com/m0_73617263/article/details/145461548m0_73617263Wed, 05 Feb 2025 20:48:48 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145455495https://blog.youkuaiyun.com/m0_73617263/article/details/145455495m0_73617263Wed, 05 Feb 2025 15:02:22 +0800https://blog.youkuaiyun.com/m0_73617263/article/details/145442685https://blog.youkuaiyun.com/m0_73617263/article/details/145442685m0_73617263Tue, 04 Feb 2025 17:47:46 +0800