1. 完美洗牌算法
题目:给定整数数组,元素为a1 a2 a3 .. an b1 b2 b3 .. bn元素个数为 2n要求:请生成如下数组,a1 b1, a2 b2, a3 b3, .. an bn. 条件:时间复杂度为O(N),空间复杂度为O(1)
http://topic.csdn.net/u/20100623/09/dd25166f-bac4-4b2d-98ab-71cab69f4241.html?54216
http://blog.csdn.net/yuan8080/article/details/5705559
http://blog.csdn.net/yuan8080/article/details/5705567
阅读全文