Leetcode561. Array Partition I
2017-08-11 09:36
381 查看
#include <algorithm> class Solution { public: int arrayPairSum(vector<int>& nums) { sort(nums.begin(),nums.end()); int ans=0; for(int i=0;i<nums.size();i+=2){ ans+=nums[i]; } return ans; } };
相关文章推荐
- leetcode:561. Array Partition I
- LeetCode 561. Array Partition I
- LeetCode 561. Array Partition I
- 【leetcode】561. Array Partition I
- LeetCode 561. Array Partition I
- python--leetcode561. Array Partition I
- [LeetCode] 561.Array Partition I
- LeetCode 561. Array Partition I (数组分隔之一)
- [LeetCode] 561. Array Partition I
- LeetCode 561. Array Partition I
- leetcode题解-561. Array Partition I && 62. Unique Paths && 63. Unique Paths II
- LeetCode 561. Array Partition I (排序、遍历)
- LeetCode-561. Array Partition I
- LeetCode 561. Array Partition I
- 【LeetCode】561. Array Partition I
- leetcode试水--561. Array Partition I
- 【跟Leon一起刷LeetCode】561. Array Partition I
- leetcode561. Array Partition I
- [Leetcode从零开刷]561. Array Partition I
- 【LeetCode】561. Array Partition I