Maximum Product Subarray
来源:互联网 发布:北京文森特软件科技 编辑:程序博客网 时间:2024/06/05 02:46
坚持,坚持,坚持
public class Solution { public int maxProduct(int[] nums) { if (nums.length == 1) { return nums[0]; } int maxProd = nums[0], maxTemp = nums[0], minTemp = nums[0]; for (int i = 1; i < nums.length; i++) { int a = nums[i] * maxTemp; int b = nums[i] * minTemp; maxTemp = Math.max(Math.max(a, b), nums[i]); minTemp = Math.min(Math.min(a, b), nums[i]); maxProd = Math.max(maxProd, maxTemp); } return maxProd; // if (nums.length == 1) // return nums[0]; // int maxProd = Integer.MIN_VALUE; // int i = 1; // for (; i < nums.length; i++) { // maxProd = Math.max(Math.max(nums[i - 1] * nums[i], nums[i]), maxProd); // } // if (i == 0) // return nums[i]; // else // return maxProd; }}
0 0
- LeetCode_Maximum Subarray | Maximum Product Subarray
- Maximum Product Subarray
- Maximum Product Subarray
- Maximum Product Subarray 【LeetCode】
- [LeetCode] Maximum Product Subarray
- leetcode-Maximum Product Subarray
- Maximum Product Subarray -- LeetCode
- LeetCode-Maximum Product Subarray
- [LeetCode]Maximum Product Subarray
- [LeetCode]Maximum Product Subarray
- 【LeetCode】Maximum Product Subarray
- leetcode:Maximum Product Subarray
- leetcode: Maximum Product Subarray
- Leetcode: Maximum Product Subarray
- Maximum Product Subarray
- Maximum Product Subarray
- [LeetCode]Maximum Product Subarray
- Leetcode Maximum Product Subarray
- State bank of India Shimla Himachal Pradesh Ifsc Codes
- Android 播放视频并获取指定时间的帧画面
- 整理Ruby相关的各种概念(rvm, gem, bundle, rake, rails等)
- Caffe小玩意(2)-从caffemodel中导出参数
- 运维中的一些概念scale-in/scale-out/scale-up/scale-down/auto-scaling
- Maximum Product Subarray
- leetcode #105 in cpp
- 简单的java代码在内存加载过程(详解)
- android 获取网络视频缩略图
- Android之使用MediaMetadataRetriever类获取视频第一帧及用法
- leetcode #106 in cpp
- 日常水
- leetcode #107 in cpp
- Maximum Noise Fraction (MNF) 中文翻译