Added 1 solution & modified 1 solution

varunu28 · varunu28 · commit ce9e131b4fa0 · 2020-08-15T15:48:34.000-05:00
diff --git a/Medium/Find Permutation.java b/Medium/Find Permutation.java
@@ -0,0 +1,23 @@
+class Solution {
+  public int[] findPermutation(String s) {
+    int[] ans = new int[s.length() + 1];
+    Stack<Integer> stack = new Stack<>();
+    int idx = 0;
+    for (int i = 1; i <= s.length(); i++) {
+      if (s.charAt(i - 1) == 'I') {
+        stack.push(i);
+        while (!stack.isEmpty()) {
+          ans[idx++] = stack.pop();
+        }
+      }
+      else {
+        stack.push(i);
+      }
+    }
+    stack.push(s.length() + 1);
+    while (!stack.isEmpty()) {
+      ans[idx++] = stack.pop();
+    }
+    return ans;
+  } 
+}
diff --git a/Medium/Non Overlapping Intervals.java b/Medium/Non Overlapping Intervals.java
@@ -1,35 +1,17 @@
-/**
- * Definition for an interval.
- * public class Interval {
- *     int start;
- *     int end;
- *     Interval() { start = 0; end = 0; }
- *     Interval(int s, int e) { start = s; end = e; }
- * }
- */
 class Solution {
-    public static int eraseOverlapIntervals(Interval[] intervals) {
-        if (intervals.length == 0) {
-            return 0;
-        }
-        
-        Arrays.sort(intervals, new Comparator<Interval>() {
-            @Override
-            public int compare(Interval o1, Interval o2) {
-                return o1.end - o2.end;
-            }
-        });
-
-        int count = 1;
-        int end = intervals[0].end;
-
-        for (int i=1; i<intervals.length; i++) {
-            if (intervals[i].start >= end) {
-                end = intervals[i].end;
-                count++;
-            }
-        }
-
-        return intervals.length - count;
+  public int eraseOverlapIntervals(int[][] intervals) {
+    if (intervals.length == 0) {
+      return 0;
     }
+    Arrays.sort(intervals, Comparator.comparingInt(o -> o[1]));
+    int notRemoved = 1;
+    int end = intervals[0][1];
+    for (int i = 1; i < intervals.length; i++) {
+      if (intervals[i][0] >= end) {
+        notRemoved++;
+        end = intervals[i][1];
+      }
+    }
+    return intervals.length - notRemoved;
+  }
 }
