Partition the Array
作者:互联网
不是O(N^2) ,是O(N)。两个指针遍历了整个数组一次
时间复杂度与最内层循环主体的执行次数有关与有多少重循环无关.
The time complexity is related to the number of executions of the innermost loop body, independent of how many repeated loops there are
标签:there,复杂度,Partition,number,related,循环,loops,Array 来源: https://www.cnblogs.com/ldphoebe/p/16495364.html