class Solution {
public:
int maxProfit(vector<int> &prices) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (prices.empty()) return 0;
int ret = 0;
int minVal = prices[0];
for (int i = 1; i < prices.size(); i++) {
minVal = min(minVal, prices[i]);
ret = max(ret, prices[i] - minVal);
}
return ret;
}
};
Small Case: 8ms
Large Case: 56ms
Time: O(n)
Space: O(1)