【Leetcode】238-Product of Array Except Self【Java实现】【Medium】【two way traverse】
来源:互联网 发布:认识数据库管理 编辑:程序博客网 时间:2024/06/08 07:58
复杂度要求O(n),不代表只能遍历一遍,可以遍历2遍、3遍。。。。
product--->名词:积
stem:
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(n).For example, given [1,2,3,4], return [24,12,8,6].Follow up:Could you solve it with constant space complexity? (Note: The output array does not count as extra space for the purpose of space complexity analysis.)
code:
public class Solution {/*by qr2015-11-7two way traverseerror:[0,4,0]*/ public int[] productExceptSelf(int[] nums) { int len=nums.length; int [] res=new int[len]; res[0]=1; for(int i=1;i<len;i++){ res[i]=res[i-1]*nums[i-1]; } int temp=1; //要乘以temp,而不是nums[i+1] for(int i=len-2;i>=0;i--){ temp*=nums[i+1]; res[i]=res[i]*temp; } return res; }}
采用了two way traverse,因为最后的结果就可以分为两个部分,左部分和右部分,所以分为两个方向的乘积。
0 0
- 【Leetcode】238-Product of Array Except Self【Java实现】【Medium】【two way traverse】
- [Leetcode 238, Medium] Product of Array Except Self
- 【Leetcode-Medium-238】Product of Array Except Self
- Leetcode 238. Product of Array Except Self (Medium) (cpp)
- LeetCode 238. Product of Array Except Self (Medium)
- leetcode 238: Product of Array Except Self
- LeetCode 238: Product of Array Except Self
- Leetcode #238 Product of Array Except Self
- Leetcode 238 Product of Array Except Self
- [leetcode 238]Product of Array Except Self
- LeetCode(238)Product of Array Except Self
- leetcode 238: Product of Array Except Self
- Leetcode #238 Product of Array Except Self
- [LeetCode 238] Product of Array Except Self
- leetcode 238:Product of Array Except Self
- Product of Array Except Self - LeetCode 238
- LeetCode 238 Product of Array Except Self
- 【LEETCODE】238-Product of Array Except Self
- LeetCode题解——Unique Binary Search Trees
- libevent代码阅读(14)——select复用机制(一)
- kd-tree
- git reflog 可以恢复删删掉的commit,比如用reset HEAD^1回退删掉的commit
- Java多线程总结
- 【Leetcode】238-Product of Array Except Self【Java实现】【Medium】【two way traverse】
- 数据库范式——通俗易懂
- 相似数据检测算法(shingle,SimHash,Bloomfilter) 比较
- 20条Linux命令面试问答
- IT人生
- 《剑指offer》——构建乘积数组
- java提取字符串中的汉字
- Effective C++ 笔记 第二部分 构造/析构/赋值运算
- leetcode-Permutations