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 possible.

Example 1:
Input: [1,4,3,2]Output: 4
Explanation: n is 2, and the maximum sum of pairs is 4.

代码实现

 public int ArrayPairSum(int[] nums) {Array.Sort(nums);int rtn = 0;for(int i=0; i<nums.Length;i=i+2)rtn+=nums[i];return rtn;}

leetcode-solution库

leetcode算法题目解决方案每天更新在github库中，欢迎感兴趣的朋友加入进来，也欢迎star，或pull request。https://github.com/jackzhenguo/leetcode-csharp

561. Array Partition I相关推荐

Leetcode PHP题解--D14 561. Array Partition I
561. Array Partition I 题目链接 561. Array Partition I 题目分析本题给了一个数组,要求将数组分为n个只有2个元素的一对. 使得每对数字中最小的数加起来的 ...
Leetcode刷题记录[java]——561 Array Partition I
一.前言二.题561 Array Partition I Given an array of 2n integers, your task is to group these integers in ...
[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 pa ...
561.Array Partition I--Python
刚开始学习Python编程,欢迎交流学习! 561.Array Partition I Given an array of 2n integers, your task is to group the ...
LeetCode 561. Array Partition I
题目: Given an array of 2n integers, your task is to group these integers into n pairs of integer, say ...
LeetCode 561 Array Partition I（数组划分）
翻译原文 Given an array of 2n integers, your task is to group these integers into n pairs of integer, s ...
leetcode#561 Array Partition I
Description: Given an array of 2n integers, your task is to group these integers into n pairs of int ...
【刷leetcode，拿Offer-009】561. Array Partition I（贪心，C++）
题目链接 Given an array of 2n integers, your task is to group these integers into n pairs of integer, sa ...
561. 数组拆分 I（javascript）561. Array Partition I
给定长度为 2n 的整数数组 nums ,你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), -, (an, bn) ,使得从 1 到 n 的 min(ai, bi) 总和 ...

561. Array Partition I

原题

代码实现

leetcode-solution库

561. Array Partition I相关推荐

最新文章

热门文章