LinkSearchMenuExpandDocument

561. Array Partition I

Solution Code

C#

publicclassSolution{publicintArrayPairSum(int[]nums){intn=nums.Length,answer=0;Array.Sort(nums);for(inti=0;i<n;i+=2)answer+=nums[i];returnanswer;}}

C++

classSolution{public:intarrayPairSum(vector<int>&nums){intn=nums.size(),answer=0;sort(nums.begin(),nums.end());for(inti=0;i<n;i+=2)answer+=nums[i];returnanswer;}};

Java

classSolution{publicintarrayPairSum(int[]nums){intn=nums.length,answer=0;Arrays.sort(nums);for(inti=0;i<n;i+=2)answer+=nums[i];returnanswer;}}

Python

classSolution(object):defarrayPairSum(self,nums):""" :type nums: List[int] :rtype: int """nums.sort()returnsum([iforiinnums[::2]])

Ruby

# @param {Integer[]} nums# @return {Integer}defarray_pair_sum(nums)nums.sort!(nums.select!.with_index{|_,i|i.even?}).sumend

Resources


© 2023. All rights reserved.

close