两个向量(数组)点对点相加(Java)

两个向量(数组)点对点相加(Java)
public class CMatrix {
    private CMatrix() {}

    /**
     * addition of two vectors.
     *
     * @param x one vector
     * @param y another vector
     * @return result vector
     */
    public static int[] add(int[] x, int[] y) {
        matrixNotNull(x, y);
        int m1 = x.length;
        int m2 = y.length;
        vectorNotEmpty(m1, m2);
        matrixNotMismatching(m1, m2);
        int[] add = new int[m1];
        for (int i = 0; i < m1; i++) {
            add[i] = x[i] + y[i];
        }
        return add;
    }

    // throw an IllegalArgumentException if obj is null
    // (obj is any type of array)
    private static void matrixNotNull(Object... obj) {
        for (Object o : obj) {
            if (o == null)
                throw new IllegalArgumentException("matrix is null");
        }
    }

    // Check if the vectors are not empty.
    private static void vectorNotEmpty(int... lens) {
        for (int len : lens) {
            if (len == 0)
                throw new EmptyVectorException();
        }
    }

    // Check if the two matrices are mismatch the number of rows.
    private static void matrixNotMismatching(int n, int m) {
        if (n != m)
            throw new MismatchingMatrixException();
    }
}

class EmptyVectorException extends RuntimeException {
    public EmptyVectorException() { super(); }

    public EmptyVectorException(String s) { super(s); }
}

class MismatchingMatrixException extends RuntimeException {

    public MismatchingMatrixException() { super(); }

    public MismatchingMatrixException(String s) { super(s); }
}
  • 1
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
/* * 基于数组向量实现 */ package dsa; public class Vector_Array implements Vector { private final int N = 1024;//数组的容量 private int n = 0;//向量的实际规模 private Object[] A;//对象数组 //构造函数 public Vector_Array() { A = new Object[N]; n = 0; } //返回向量中元素数目 public int getSize() { return n; } //判断向量是否为空 public boolean isEmpty() { return (0 == n) ? true : false; } //取秩为r的元素 public Object getAtRank(int r)//O(1) throws ExceptionBoundaryViolation { if (0 > r || r >= n) throw new ExceptionBoundaryViolation("意外:秩越界"); return A[r]; } //将秩为r的元素替换为obj public Object replaceAtRank(int r, Object obj) throws ExceptionBoundaryViolation { if (0 > r || r >= n) throw new ExceptionBoundaryViolation("意外:秩越界"); Object bak = A[r]; A[r] = obj; return bak; } //插入obj,作为秩为r的元素;返回该元素 public Object insertAtRank(int r, Object obj) throws ExceptionBoundaryViolation { if (0 > r || r > n) throw new ExceptionBoundaryViolation("意外:秩越界"); if (n >= N) throw new ExceptionBoundaryViolation("意外:数组溢出"); for (int i=n; i>r; i--) A[i] = A[i-1];//后续元素顺次后移 A[r] = obj;//插入 n++;//更新当前规模 return obj; } //删除秩为r的元素 public Object removeAtRank(int r) throws ExceptionBoundaryViolation { if (0 > r || r >= n) throw new ExceptionBoundaryViolation("意外:秩越界"); Object bak = A[r]; for (int i=r; i<n; i++) A[i] = A[i+1];//后续元素顺次前移 n--;//更新当前规模 return bak; } }

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值