Create Best Time to Buy and Sell Stock

First of all we take two integar as maximum profit whic is initially set to be zero and minimum so far which is the first element of the prices then we traverse and found the minimum between the minsofar and prices then we calculate the profit among them. then we find out the max between the maxprofit and calculated profit.

Best Time to Buy and Sell Stock

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int maxProfit(vector<int>& prices) {
+        int maxprofit=0;
+        int minsofar=prices[0];
+        int n= prices.size();
+        for(int i=0 ; i<n ; i++){
+            minsofar=min(minsofar,prices[i]);
+            int profit=prices[i]-minsofar;
+            maxprofit=max(maxprofit,profit);
+        }
+        return maxprofit;
+    }
+};