2017年4月24日
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 to n as large as poss... 阅读全文
posted @ 2017-04-24 23:49 xiejunzhao 阅读(113) 评论(0) 推荐(0)