Leetcode刷题记录[java]——561 Array Partition I

一、前言

二、题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: 4Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
Note:

n is a positive integer, which is in the range of [1, 10000].

All the integers in the array will be in the range of [-10000, 10000].

三、解题思路

 1 class Solution {
 2     public int arrayPairSum(int[] nums) {
 3         Arrays.sort(nums);
 4         int result = 0;
 5         for (int i = 0; i < nums.length; i += 2) {
 6             result += nums[i];
 7         }
 8         return result;
 9     }
10 }

转载于:https://www.cnblogs.com/Myoungs/p/7832870.html

Leetcode刷题记录[java]——561 Array Partition I相关推荐

算法记录牛客网 leetcode刷题记录
算法记录 & 牛客网 & leetcode刷题记录解题思路 STL容器常用算法模板堆排序插入排序快速排序 BFS层序遍历二叉树 JZ55 二叉树的深度 BST(binary ...
LeetCode刷题记录12——232. Implement Queue using Stacks（easy）
LeetCode刷题记录12--232. Implement Queue using Stacks(easy) 目录 LeetCode刷题记录12--232. Implement Queue usin ...
LeetCode刷题记录11——290. Word Pattern（easy）
LeetCode刷题记录11--290. Word Pattern(easy) 目录 LeetCode刷题记录11--290. Word Pattern(easy) 题目语言思路源码后记题目 ...
LeetCode刷题记录10——434. Number of Segments in a String（easy）
LeetCode刷题记录10--434. Number of Segments in a String(easy) 目录 LeetCode刷题记录9--434. Number of Segments ...
LeetCode刷题记录9——58. Length of Last Word（easy）
LeetCode刷题记录9--58. Length of Last Word(easy) 目录 LeetCode刷题记录9--58. Length of Last Word(easy) 题目语言思 ...
LeetCode刷题记录8——605. Can Place Flowers（easy）
LeetCode刷题记录8--605. Can Place Flowers(easy) 目录 LeetCode刷题记录8--605. Can Place Flowers(easy) 题目语言思路 ...
LeetCode刷题记录7——824. Goat Latin（easy）
LeetCode刷题记录7--824. Goat Latin(easy) 目录 LeetCode刷题记录7--824. Goat Latin(easy) 题目语言思路后记题目题目需要将一个输 ...
LeetCode刷题记录6——696. Count Binary Substrings（easy）
LeetCode刷题记录6--696. Count Binary Substrings(easy) 目录 LeetCode刷题记录6--696. Count Binary Substrings(eas ...
LeetCode刷题记录5——441. Arranging Coins（easy）
LeetCode刷题记录5--441. Arranging Coins(easy) 目录 LeetCode刷题记录5--441. Arranging Coins(easy) 题目语言思路后记题 ...

Leetcode刷题记录[java]——561 Array Partition I

Leetcode刷题记录[java]——561 Array Partition I相关推荐

最新文章

热门文章