开始刷leedtcode day72:Product of Array Except Self
来源:互联网 发布:centos 安装opera 编辑:程序博客网 时间:2024/06/05 23:58
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.)
Java:
public class Solution {
public int[] productExceptSelf(int[] nums) {
int prd = 1;
int[] result = new int[nums.length];
for(int i=0; i<nums.length; i++)
{
result[i] = prd;
prd *= nums[i];
}
prd = 1;
for(int i=nums.length-1 ; i>=0; i--)
{
result[i] *= prd;
prd *= nums[i];
}
return result;
}
}
- 开始刷leedtcode day72:Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- Product of Array Except Self
- 【PHP学习】函数
- Twemproxy源码分析之三:其进程以及时间模型
- ndk-lib实现编译并将生成文件拷贝到项目libs中
- 推荐一本Android开发入门书籍
- Android学习之SharePreferences轻量级数据存储
- 开始刷leedtcode day72:Product of Array Except Self
- 周一工作
- [高可用]Ubuntu搭建高可用的MariaDB Galera数据库集群
- JAVA常用类之——Date,Calendar,DateFomat
- ArcGIS版本编辑流程
- 【从零单排之微软面试100题系列】15之二叉树的镜像
- 解决外网无法访问Linux主机上的tomcat问题
- twemproxy源码分析之四:处理流程ji(内容属于转载。这是我看到的一篇十分详尽的分析http://idning.git
- Tomcat的Web部署