解题思路:
(1)同时记录最小值和最大值
class Solution {
public:
int maxProfit(vector<int>& p) {
int minsum=INT_MAX;
int maxsum=0;
for(int i=0;i<p.size();i++) {
if(minsum>p[i]) minsum=p[i];
if(p[i]-minsum>maxsum) maxsum=p[i]-minsum;
}
return maxsum;
}
};