Skip to content

Commit d1bd797

Browse files
author
chenweijie
committed
array
1 parent 149e13c commit d1bd797

2 files changed

Lines changed: 61 additions & 0 deletions

File tree

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
package com.chen.algorithm.znn.array.test1712;
2+
3+
/**
4+
* https://leetcode-cn.com/problems/ways-to-split-array-into-three-subarrays/
5+
* 我们称一个分割整数数组的方案是 好的,当它满足:
6+
*
7+
* 数组被分成三个 非空连续子数组,从左至右分别命名为left,mid,right。
8+
* left中元素和小于等于mid中元素和,mid中元素和小于等于right中元素和。
9+
* 给你一个 非负 整数数组nums,请你返回好的 分割 nums方案数目。由于答案可能会很大,请你将结果对 109+ 7取余后返回。
10+
*
11+
*
12+
*
13+
*/
14+
public class Solution {
15+
}
Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
package com.chen.algorithm.znn.array.test561;
2+
3+
import org.junit.Test;
4+
5+
import java.util.Arrays;
6+
7+
/**
8+
* https://leetcode-cn.com/problems/array-partition-i/solution/shu-zu-chai-fen-i-by-leetcode/
9+
* 给定长度为2n的整数数组 nums ,你的任务是将这些数分成n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ,使得从 1 到n 的 min(ai, bi) 总和最大。
10+
* 返回该 最大总和 。
11+
* 示例 1:
12+
* 输入:nums = [1,4,3,2]
13+
* 输出:4
14+
* 解释:所有可能的分法(忽略元素顺序)为:
15+
* 1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3
16+
* 2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3
17+
* 3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4
18+
* 所以最大总和为 4
19+
*
20+
* @Auther: zhunn
21+
* @Date: 2020/11/5 18:46
22+
* @Description: 数组拆分 I
23+
*/
24+
public class Solution {
25+
26+
public int arrayPairSum(int[] nums) {
27+
if (nums == null || nums.length == 0) {
28+
return 0;
29+
}
30+
//初始一个结果
31+
int sum = 0;
32+
//对数组进行升序排序
33+
Arrays.sort(nums);
34+
//循环数组,选择索引为0、2、4、6、8...这样可以保证获取每两个元素的最小值
35+
for (int i = 0; i < nums.length; i += 2) {
36+
sum += nums[i]; //将最小值加起来
37+
}
38+
return sum;
39+
}
40+
41+
@Test
42+
public void test() {
43+
int[] nums = new int[]{1, 4, 3, 2};
44+
System.out.println(arrayPairSum(nums));
45+
}
46+
}

0 commit comments

Comments
 (0)