238. Product of Array Except Self
2016-03-18 00:00
337 查看
将数组进行两次遍历，第一遍将nums[i]左边的数组相乘，第二次从后往前遍历，可将nums[i]右边的数组相乘
public class Solution {
public int[] productExceptSelf(int[] nums) {
int N = nums.length;
if(N <= 1) return nums;
int[] output = new int
;
output[0] = 1;
for(int i = 1; i < N; i++){
output[i] = output[i - 1] * nums[i - 1];
}
int right = 1;
for(int i = N - 1; i >= 0; i--){
output[i] *= right;
right *= nums[i];
}
return output;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解