Leetcode:628. Maximum Product of Three Numbers
来源:互联网 发布:企业名录数据库 编辑:程序博客网 时间:2024/06/08 02:27
Given an integer array, find three numbers whose product is maximum and output the maximum product.
Example 1:
Input: [1,2,3]
Output: 6
Example 2:
Input: [1,2,3,4]
Output: 24
Note:
The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
Multiplication of any three numbers in the input won’t exceed the range of 32-bit signed integer.
public static int maximumProduct(int[] nums) { Arrays.sort(nums); //-1 0 1 2 3 //-2 -1 0 2 3 4 //-3 -2 -1 1 2 3 //-4 -3 -2 -1 0 int a = nums[nums.length - 1] * nums[nums.length - 2] * nums[nums.length - 3]; int b = nums[0] * nums[1] * nums[nums.length - 1]; return a>b?a:b; }
阅读全文
0 0
- [leetcode]628. Maximum Product of Three Numbers
- leetcode#628. Maximum Product of Three Numbers
- leetcode: 628. Maximum Product of Three Numbers
- leetcode 628. Maximum Product of Three Numbers
- [LeetCode] 628. Maximum Product of Three Numbers
- [leetcode]628. Maximum Product of Three Numbers
- LeetCode 628. Maximum Product of Three Numbers
- leetcode -- 628. Maximum Product of Three Numbers
- [LeetCode]628. Maximum Product of Three Numbers
- [LeetCode]628. Maximum Product of Three Numbers
- 【LeetCode】628. Maximum Product of Three Numbers
- LeetCode 628. Maximum Product of Three Numbers
- Leetcode:628. Maximum Product of Three Numbers
- LeetCode 628. Maximum Product of Three Numbers
- 【LeetCode】628. Maximum Product of Three Numbers
- LeetCode-628. Maximum Product of Three Numbers
- leetcode 628. Maximum Product of Three Numbers
- leetcode 628:Maximum Product of Three Numbers
- 微服务在互联网公司演进过程
- 使用go写了一个简单ini解析器
- Redis之 集合(Sets)
- 小周seo:百度是怎么判断那些是优质内容
- android 解决oppoR9s只请求一次联网权限问题
- Leetcode:628. Maximum Product of Three Numbers
- U盘读写基础知识
- opencv寻找已知物体
- extern关键词
- JQuery(3)--冒泡效果
- 综合性18道面试官必问经典Java面试题!
- X
- Java第一章练习习题
- [001]ccs5.3环境配置及第一个程序