public class Solution {
public int[] multiply(int[] A) {
if(A.length<1) return A;
int[] result = new int[A.length];
int[] c = new int[A.length];
c[0] = 1;
int[] d = new int[A.length];
d[A.length-1] = 1;
for(int i = 1;i<c.length;i++)
{
c[i] = c[i-1] * A[i-1];
}
for(int i = d.length-2;i>=0;i--)
{
d[i] = d[i+1] * A[i+1];
}
for(int i=0;i<result.length;i++)
result[i] = c[i] *d[i];
return result;
}
}
66、构建乘积数组
最新推荐文章于 2018-12-10 16:24:16 发布