Java 将第二个数组中的值添加到第一个数组，重用第一个数组，如果可能的话，结果将被扩展以适合数组中数组元素的最大数量。
将第二个数组中的值添加到第一个数组中，并在可能的情况下重用第一个数组。结果将扩展为适合任一数组中最大数组元素的数量
实例源码：
源代码：
执行
执行中...
x
1
/** 时代Java - nowjava.com 提 供 **/2
3
4
//package com.nowjava;5
6
import java.util.Arrays;7
8
9
public class Main {10
11
public static void main(String[] argv) throws Exception {12
13
int[] first = new int[] { 34, 35, 36, 37, 37, 37, 67, 68, 69 };14
15
int[] second = new int[] { 34, 35, 36, 37, 37, 37, 67, 68, 69 };16
17
System.out.println(java.util.Arrays.toString(add(first, second)));18
19
}20
21
22
private static int[] EMPTY_INT_ARRAY = new int[0];23
24
private static float[] EMPTY_FLOAT_ARRAY = new float[0];25
26
27
/**28
29
* Adds the values from the second array to the first,30
31
* reusing the first array if possible32
33
* The result will be expanded to fit the maximum number of array elements in either array34
35
*/36
37
public static int[] add(int[] first, int[] second) {38
39
if (first == null && second == null)40
41
return EMPTY_INT_ARRAY;42
43
if (second == null)44
45
return first;46
47
if (first == null)48
/* 49
来自 50
*时代Java公众号 - N o w J a v a . c o m*/51
52
return Arrays.copyOf(second, second.length);53
54
if (first.length < second.length) {55
56
first = Arrays.copyOf(first, second.length);57
58
}59
60
int nOverlap = Math.min(first.length, second.length);61
62
for (int i = 0; i < nOverlap; i++) {63
64
first[i] += second[i];65
66
}67
68
return first;69
70
}71
72
73
/**74
75
* Adds the values from the second array to the first,76
77
* reusing the first array if possible78
79
* The result will be expanded to fit the maximum number of array elements in either array80
81
*/82
83
public static float[] add(float[] first, float[] second) {84
85
if (first == null && second == null)86
87
return EMPTY_FLOAT_ARRAY;88
89
if (second == null)90
91
return first;92
93
if (first == null)94
95
return Arrays.copyOf(second, second.length);96
97
if (first.length < second.length) {98
99
first = Arrays.copyOf(first, second.length);100
101
}102
103
int nOverlap = Math.min(first.length, second.length);104
105
for (int i = 0; i < nOverlap; i++) {106
107
first[i] += second[i];108
109
}110
111
return first;112
113
}114
115
116
/**117
118
* Adds the given value to the given position in the array, copying and padding with zeroes119
120
* is required.121
122
* @param array123
124
* @param position125
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java