數組劃分獲取較小值的和 Array Partition I

爲什麼80%的碼農都做不了架構師？>>>    問題： Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i

>>阅读原文<<