完美数组java_数组问题（Java实现）

import java.util.HashSet;

public class Solution {

// Parameters:

// numbers: an array of integers

// length: the length of array numbers

// duplication: (Output) the duplicated number in the array number,length of duplication array is 1,so using duplication[0] = ? in implementation;

// Here duplication like pointor in C/C++, duplication[0] equal *duplication in C/C++

// 这里要特别注意~返回任意重复的一个，赋值duplication[0]

// Return value: true if the input is valid, and there are some duplications in the array number

// otherwise false

public boolean duplicate(int numbers[],int length,int [] duplication) {

if(length <= 0){

return false;

}

HashSet se = new HashSet<>();

for(int i = 0; i < length;i++){

if(se.contains(numbers[i])){

duplication[0] = numbers[i];

return true;

}else{

se.add(numbers[i]);

}

}

return false;

}

}

构建乘积数组

题目描述

给定一个数组A[0,1,...,n-1],请构建一个数组B[0,1,...,n-1],其中B中的元素B[i]=A[0]*A[1]*...*A[i-1]*A[i+1]*...*A[n-1]。不能使用除法。

import java.util.ArrayList;

public class Solution {

public int[] multiply(int[] A) {

int len = A.length;

int[] B = new int[len];

int res = 1;

for(int i = 0;i < len;res *= A[i++]){

B[i] = res;

}

res = 1;

for(int j = len - 1;j >= 0;res *= A[j--]){

B[j] *= res;

}

return B;

}

}