561. Array Partition I
2018-01-07 20:51
423 查看
题意大概是给出一堆数,要让它们两两组合使它们的和从小到大排列,然后把每一组里面的最小的那个拿出来相加,返回它们的和。想法是先给这个数组排个序,然后得到从小到大的数组,那么从头开始的每两位是为一组,也就是从第一位开始每隔一位相加就是我们要的结果。代码如下:
class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int sum = 0;
for (int i = 0; i < nums.length; i += 2) {
sum += nums[i];
}
return sum;
}
}
class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int sum = 0;
for (int i = 0; i < nums.length; i += 2) {
sum += nums[i];
}
return sum;
}
}
相关文章推荐
- LeetCode 561 Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- Leetcode 561 Array Partition I
- LeetCode - 561 - Array Partition I
- 561. Array Partition I
- leetcode-561(Array Partition I)
- Leetcode 561:Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- leetcode561: Array Partition I
- Array Partition I[LeetCode 561]
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- LeetCode 561 : ArrayPartition I
- 561. Array Partition I