Merge pull request neetcode-gh#1842 from gnohgnij/735-asteroid-collision

Create: 0735-asteroid-collision.java

Author: tahsintunan

java/0735-asteroid-collision.java

@@ -0,0 +1,34 @@
+class Solution {
+    public int[] asteroidCollision(int[] asteroids) {
+        Stack<Integer> stack = new Stack<>();
+        int index = 0;
+        
+        while(index < asteroids.length) {
+            int a = asteroids[index];
+            if(stack.isEmpty()) {
+                stack.push(a);
+                index++;
+            } else {
+                if(stack.peek() > 0 && a < 0) {
+                    if(Math.abs(stack.peek()) > Math.abs(a)) {
+                        index++;
+                    } else if(Math.abs(stack.peek()) < Math.abs(a)) {
+                        stack.pop();
+                    } else {
+                        index++;
+                        stack.pop();
+                    }
+                } else {
+                    stack.push(a);
+                    index++;
+                }
+            }
+        }
+        
+        int[] res = new int[stack.size()];
+        for(int i=res.length-1; i>=0 ;i--) {
+            res[i] = stack.pop();
+        }
+        return res;
+    }
+}