本文深入探讨了一过式排序算法的实现原理，通过三个指针(first, last, cur)巧妙地解决了数组中0、1、2三类元素的排序问题，避免了传统两遍扫描的复杂度，极大地提高了排序效率。
two pass solution. count number of one’s, two’s, three’s in first pass, then fill three types of number in second pass
Error:
N/A
update:
one pass solution:
use three pointer: first-> indicate the element behind it is 0; last-> indicate the element in front of it is 2; cur->indicate current handle element. So if current element is 1, it means it is correct index, if it is 0, swap with first, it it is 2, swap with last
扫一扫
202
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
