Brute force approach

Author: amarchourasia98

src/main/java/com/leetcode/arrays/BuySellStocks.java

@@ -39,20 +39,19 @@ public class BuySellStocks {
      * @param prices
      * @return
      */
-    public static int maxProfit(int[] prices) {
-        int profit = 0;
-        int buyPrice = Integer.MAX_VALUE;
-
-        for (int i = 0; i < prices.length; i++) {
-            if (prices[i] < buyPrice) {
-                buyPrice = prices[i];
-            } else if (prices[i] - buyPrice > profit) {
-                profit = prices[i] - buyPrice;
+    public class Solution {
+    public int maxProfit(int prices[]) {
+        int maxprofit = 0;
+        for (int i = 0; i < prices.length - 1; i++) {
+            for (int j = i + 1; j < prices.length; j++) {
+                int profit = prices[j] - prices[i];
+                if (profit > maxprofit)
+                    maxprofit = profit;
             }
         }
-
-        return profit;
+        return maxprofit;
     }
+}
 
     public static void main(String[] args) {