Arrays 2

Anuj-Kumar-Sharma · Anuj-Kumar-Sharma · commit fe327bfca406 · 2022-06-13T19:13:34.000+05:30
diff --git a/arrays1/ArraysMain.java b/arrays1/ArraysMain.java
@@ -48,23 +48,33 @@ public static int delete(int a[], int key) {
 	}
 	
 	
+	static void maxLeft(int a[]) {
+		int max = 0;
+		for(int i = a.length-1; i>=0; i--) {
+			int temp = a[i];
+			a[i] = max;
+			max = Math.max(max, temp);
+		}
+	}
 	
 	public static void main(String[] args) {
 		
-		int a[] = {2, 1, 4, 6, 50};
+		int a[] = {2, 1, 4, 6, 3};
 		int key = 2;
 		
 //		delete(a, key);
 		
 //		int index = maxOf(a);
 //		System.out.println(a[index]);
 		
-		int index = secondLargest(a);
-		System.out.println(a[index]);
+//		int index = secondLargest(a);
+//		System.out.println(a[index]);
+		
+		maxLeft(a);
 		
-//		for(int e: a) {
-//			System.out.print(e+" ");
-//		}
+		for(int e: a) {
+			System.out.print(e+" ");
+		}
 		
 //		int res = -1;
 //		// search for key
diff --git a/arrays2/MainClass.java b/arrays2/MainClass.java
@@ -0,0 +1,96 @@
+package arrays2;
+
+public class MainClass {
+	
+	static int containerWithMostWater(int a[]) {
+		
+		int maxArea = 0;
+		int l = 0;
+		int r = a.length-1;
+		
+		while(l < r) {
+			int height = Math.min(a[l], a[r]);
+			int distance = r-l;
+			
+			int area = height*distance;
+			maxArea = Math.max(maxArea, area);
+			
+			if(a[l] < a[r]) {
+				l++;
+			} else {
+				r--;
+			}
+		}
+		
+		return maxArea;
+	}
+	
+	
+	
+	
+	
+//	{-2, 7, -6, -4, 1, -3, 8};
+//	
+//	cur = 8
+//	max = 8
+	
+	static int largestSumSubArray(int a[]) {
+		
+		int curSum = 0;
+		int maxSum = Integer.MIN_VALUE;
+		
+//		int start = 
+//		int ansStart = 
+//		int end = 
+		
+		for(int i = 0; i<a.length; i++) {
+			curSum += a[i];
+			if(maxSum < curSum) {
+				maxSum = curSum;
+				//update end
+			}
+			if(curSum < 0) {
+				curSum = 0;
+				// reset start = i
+			}
+		}
+		
+		return maxSum;
+	}
+	
+	
+//
+//	largest = 7
+//	3 4 6 7
+	
+	static void leadersinAnArray(int a[]) {
+		int largest = Integer.MIN_VALUE;
+//		int b[] = new int[a.length];
+//		int j = 0;
+		for(int i = a.length-1; i>=0; i--) {
+			if(a[i] > largest) {
+				largest = a[i];
+				System.out.print(a[i]+" ");
+//				b[j++] = a[i];
+			}
+		}
+//		for(j=j-1; j>=0; j--) {
+//			System.out.println(b[j]+" ");
+//		}
+	}
+	
+	public static void main(String[] args) {
+		
+//		int a[] = {-2, -7, -6, -4, -1, -3, -8};
+//		leadersinAnArray(a);
+//		int ans = largestSumSubArray(a);
+//		
+//		System.out.println(ans);
+		
+		
+		int a[] = {1, 8, 6, 2, 4, 5, 8, 3, 7};
+		int ans = containerWithMostWater(a);
+		System.out.println(ans);
+	}
+
+}
