[LeetCode]561. Array Partition I (数组分区 1)

561. Array Partition I 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 from 1

>>阅读原文<<