[leetCode][001]MaximumProductSubarray

1 class Solution {
2 public:
3 int maxProduct(int A[], int n) {
4 int nMaxPro &＃61; A[0];
5 int max_tmp &＃61; A[0];
6 int min_tmp &＃61; A[0];
7
8 for(int i &＃61; 1; ii){
9 int a &＃61; A[i] * max_tmp;
10 int b &＃61; A[i] * min_tmp;
11
12 max_tmp &＃61; (( a > b ? a : b ) > A[i]) ? ( a > b ? a : b ) : A[i];
13 min_tmp &＃61; (( a a : b ) : A[i];
14
15 nMaxPro &＃61; (nMaxPro > max_tmp) ? nMaxPro : max_tmp;
16 }
17
18 return nMaxPro;
19 }
20 };