Java 计算两个数组的标量积，就好像它们是向量一样。
计算两个数组的标量积，就好像它们是矢量一样。
实例源码：
源代码：
执行
执行中...
x
1
2
3
//package com.nowjava;4
5
6
public class Main {7
/**8
时代Java - N o w J a v a . c o m 提供 9
**/10
11
public static void main(String[] argv) throws Exception {12
13
double[] w0 = new double[] { 34.45, 35.45, 36.67, 37.78, 37.0000,14
15
37.1234, 67.2344, 68.34534, 69.87700 };16
17
double[] w1 = new double[] { 34.45, 35.45, 36.67, 37.78, 37.0000,18
19
37.1234, 67.2344, 68.34534, 69.87700 };20
21
System.out.println(scalarProduct(w0, w1));22
23
}24
25
26
/**27
28
* Computes the scalar product of two array as if they were vectors.29
30
*31
32
* @throws IllegalArgumentException if the don't have the same length33
34
*/35
36
public static double scalarProduct(double[] w0, double[] w1) {37
38
if (w0.length != w1.length) {39
40
throw new IllegalArgumentException(41
42
"Arrays must have the same length : " + w0.length43
44
+ ", " + w1.length);45
46
}47
48
if (w0.length == 0)49
50
throw new IllegalArgumentException(//时 代 J a v a - nowjava.com 提供51
52
"Nothing to compute! Arrays must have at least one element.");53
54
double sortie = 0.0;55
56
for (int k = 0; k < w0.length; k++) {57
58
sortie += w0[k] * w1[k];59
60
}61
62
return (sortie);63
64
}65
66
67
/**68
69
* Computes the scalar product of two array as if they were matrices.70
71
*72
73
* @throws IllegalArgumentException if the don't have the same length74
75
*/76
77
public static double scalarProduct(double[][] w0, double[][] w1) {78
79
if (w0.length != w1.length) {80
81
throw new IllegalArgumentException(82
83
"Arrays must have the same length : " + w0.length84
85
+ ", " + w1.length);86
87
}88
89
if (w0.length == 0)90
91
throw new IllegalArgumentException(92
93
"Nothing to compute! Arrays must have at least one element.");94
95
double sortie = 0.0;96
97
for (int k = 0; k < w0.length; k++) {98
99
sortie = sortie + scalarProduct(w0[k], w1[k]);100
101
}102
103
return (sortie);104
105
}106
107
108
/**109
110
* Computes the scalar product of two array111
112
* as if they were vectors.113
114
*115
116
* @throws IllegalArgumentException if the117
118
* don't have the same length.119
120
*/121
122
public static int scalarProduct(int[] w0, int[] w1) {123
124
if (w0.length != w1.length) {125
126
throw new IllegalArgumentException(127
128
"Arrays must have the same length : " + w0.length129
130
+ ", " + w1.length);131
132
}133
134
if (w0.length == 0)135
136
throw new IllegalArgumentException(137
138
"Nothing to compute! Arrays must have at least one element.");139
140
int sortie = 0;141
142
for (int k = 0; k < w0.length; k++) {143
144
sortie = sortie + w0[k] * w1[k];145
146
}147
148
return (sortie);149
150
}151
152
153
/**154
155
* Computes the scalar product of two array156
157
* as if they were matrices.158
159
*160
161
* @throws IllegalArgumentException if the162
163
* don't have the same length.164
165
*/166
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java