时代Java,与您同行!
关注微信公众号,关注前沿技术,微信搜索:nowjava或时代Java,也可点击这里扫码关注
时代Java
首页
集册
文章
实例
项目
快讯
时代+
手册
下载
Jar查找
登录
注册
Java 添加到数组w,a乘以v,其中a是标量。
Java 添加到数组w,a乘以v,其中a是标量。
欢马劈雪
工程师 (已认证)
原创分享签约作者
发表于
实例源码
订阅
755
查看 / 运行 实例源码
添加到数组w,a乘以v,其中a是标量。
实例源码:
源代码:
执行
执行中...
//package com.nowjava; /*来自 N o w J a v a . c o m*/ public class Main { public static void main(String[] argv) throws Exception { double[] w = new double[] { 34.45, 35.45, 36.67, 37.78, 37.0000, 37.1234, 67.2344, 68.34534, 69.87700 }; double a = 2.45678; System.out.println(java.util.Arrays.toString(add(w, a))); } /** * Adds to an array w, a times v where a is a scalar. * Since v can be smaller then w, we must specified the position at which v will be added. * * @param a scalar. * @param p position. */ public static double[] add(double[] w, double a, double[] v, int p) { if (v.length > w.length) { throw new IllegalArgumentException( "Second array must be shorter or equal to the first one : " + w.length + ", " + v.length); } double[] ans = copy(w);/*来自 NowJava.com - 时代Java*/ for (int k = p; k < p + v.length; k++) { ans[k] += a * v[k - p]; } return (ans); } /** * Adds a scalar to every element in the array. */ public static double[] add(double[] w, double a) { double[] ans = copy(w); for (int k = 0; k < ans.length; k++) { ans[k] += a; } return (ans); } /** * Adds the two arrays together (componentwise). * * @throws IllegalArgumentException if the * two arrays don't have the same length. */ public static double[] add(double[] a, double[] b) { if (a.length != b.length) { throw new IllegalArgumentException( "To add two arrays, they must have the same length : " + a.length + ", " + b.length); } double[] ans = copy(a); for (int i = 0; i < a.length; i++) { ans[i] += b[i]; } return (ans); } /** * Adds to an array w, a times v where a is a scalar. * Since v can be smaller then w, we must specified the position at which v will be added. * * @param a scalar. * @param p position. * @param w longer array. * @param v shorter array. * @throws IllegalArgumentException if the second array * is not shorter than the first one. */ public static int[] add(int[] w, double a, int[] v, int p) { if (v.length > w.length) { throw new IllegalArgumentException( "Second array must be shorter or equal to the first one : " + w.length + ", " + v.length); } int[] ans = copy(w); for (int k = p; k < p + v.length; k++) { ans[k] += a * v[k - p]; } return (ans); } /** * Adds a scalar to every element in the array. */ public static int[] add(int[] w, int a) { int[] ans = copy(w); for (int k = 0; k < ans.length; k++) { ans[k] += a; } return (ans); } /** * Adds the two arrays together (componentwise). * * @throws IllegalArgumentException if the * two arrays don't have the same length. */ public static int[] add(int[] a, int[] b) { if (a.length != b.length) { throw new IllegalArgumentException( "To add two arrays, they must have the same length : " + a.length + ", " + b.length); } int[] ans = copy(a); for (int i = 0; i < a.length; i++) { ans[i] += b[i]; } return (ans); } /** * Returns a comma delimited string representing the value of the array. */ public static String toString(double[] array) { StringBuffer buf = new StringBuffer(array.length); int i; for (i = 0; i < array.length - 1; i++) { buf.append(array[i]); buf.append(','); } buf.append(array[i]); return buf.toString(); } /** * Returns a comma delimited string representing the value of the array. */ public static String toString(double[][] array) { StringBuffer buf = new StringBuffer(); for (int k = 0; k < array.length; k++) { buf.append(toString(array[k])); buf.append(System.getProperty("line.separator")); } return buf.toString(); } /** * Returns a comma delimited string representing the value of the array. */ public static String toString(int[] array) { StringBuffer buf = new StringBuffer(array.length); int i; for (i = 0; i < array.length - 1; i++) { buf.append(array[i]); buf.append(','); } buf.append(array[i]); return buf.toString(); } /** * Returns a comma delimited string representing the value of the array. */ public static String toString(int[][] array) { StringBuffer buf = new StringBuffer(); for (int k = 0; k < array.length; k++) { buf.append(toString(array[k])); buf.append(System.getProperty("line.separator")); } return buf.toString(); } /** * Returns a copy of the array. */ //a call to array.clone() may also work although this is a primitive type. I haven't checked //it even may be faster public static int[] copy(int[] array) { int[] result; result = new int[array.length]; System.arraycopy(array, 0, result, 0, array.length); return result; } /** * Returns a copy of the array. */ //a call to array.clone() may also work although this is a primitive type. I haven't checked //it even may be faster public static long[] copy(long[] array) { long[] result; result = new long[array.length]; System.arraycopy(array, 0, result, 0, array.length); return result; } /** * Returns a copy of the array. */ //a call to array.clone() may also work although this is a primitive type. I haven't checked /**代码未完, 请加载全部代码(NowJava.com).**/
编辑/阅读全部代码
执行结果:
[36.906780000000005, 37.906780000000005, 39.126780000000004, 40.23678, 39.45678, 39.58018, 69.69117999999999, 70.80211999999999, 72.33377999999999]
本文系作者在时代Java发表,未经许可,不得转载。如有侵权,请联系nowjava@qq.com删除。
编辑于
2020-03-26 09:23:27
2020-03-26 09:23:27
分享
分享文章到朋友圈
分享文章到 QQ
分享文章到微博
复制文章链接到剪贴板
扫描二维码
关注时代Java
实例源码
实例源码
订阅
订阅专栏
Java 判断文件是否为文本文件及获取文件编码格式的方法实例
bootstrap 实例演示下拉菜单(Dropdown)插件用法。
HashSet、LinkedHashSet、TreeSet类存储元素的自动排序规则实例测试
html css 对于 body和h1设置的实例源码
Java 获取在线网页的源代码
Java HashSet添加、迭代输出字符串的完整示例代码
Java 随机整数数组
html css 设置背景图片定位并且不平铺
扫描二维码
关注时代Java
返回顶部