Product of Array Exclude Itself
来源:互联网 发布:爱思助手mac下载 编辑:程序博客网 时间:2024/06/06 08:37
Given an integers array A.
Define B[i] = A[0] * … * A[i-1] * A[i+1] * … * A[n-1], calculate B WITHOUT divide operation.
Have you met this question in a real interview? Yes
Example
For A = [1, 2, 3], return [6, 3, 2].
public class Solution { /** * @param A: Given an integers array A * @return: A Long array B and B[i]= A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1] */ public ArrayList<Long> productExcludeItself(ArrayList<Integer> A) { // write your code ArrayList<Long> res = new ArrayList<Long>(); if (A==null || A.size()==0 ) return res; long[] lProduct = new long[A.size()]; long[] rProduct = new long[A.size()]; lProduct[0] = 1; for (int i=1; i<A.size(); i++) { lProduct[i] = lProduct[i-1]*A.get(i-1);//left 累× } rProduct[A.size()-1] = 1;//right 累× for (int j=A.size()-2; j>=0; j--) { rProduct[j] = rProduct[j+1]*A.get(j+1); } for (int k=0; k<A.size(); k++) { res.add(lProduct[k] * rProduct[k]); } return res; }}
0 0
- Product of Array Exclude Itself
- Product of Array Exclude Itself
- Product of Array Exclude Itself
- Lintcode - Product of Array Exclude Itself
- lintcode:Product of Array Exclude Itself
- [Lintcode]Product of Array Exclude Itself
- #50 Product of Array Exclude Itself
- Lintcode50 Product of Array Exclude Itself solution 题解
- 【LintCode】Product of Array Exclude Itself 数组剔除元素后的乘积
- 50.Product of Array Exclude Itself-数组剔除元素后的乘积(容易题)
- 238.[LeetCode]Product of Array Except itself
- 238.[LeetCode]Product of Array Except itself
- 88-Product of Array
- get product of array
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- sql注入
- oracle之表对象操作
- bzoj3209 花神的数论题
- 17.指针与数组
- HDU_1711_NumberSequence
- Product of Array Exclude Itself
- VMware Fusion自动切换分辨率的头疼问题解决办法
- 类的成员函数
- 16-题目1161:Repeater
- 适配器模式
- 理解RESTful架构
- Hadoop2.7.2版本分布式集群搭建详细记录(2)
- Skinned Mesh原理解析和一个最简单的实现示例
- 构建微服务-第一章-什么是微服务_002技术多样性