Added 4 solutions

varunu28 · varunu28 · commit 78bef16bec05 · 2017-12-01T10:33:55.000-08:00
diff --git a/Easy/Heaters.java b/Easy/Heaters.java
@@ -0,0 +1,20 @@
+class Solution {
+    public int findRadius(int[] houses, int[] heaters) {
+        Arrays.sort(heaters);
+        int max = Integer.MIN_VALUE;
+        
+        for (int house : houses) {
+            int ind = Arrays.binarySearch(heaters, house);
+            
+            if (ind < 0) {
+                ind = - (ind + 1);
+            }
+            int d1 = ind - 1 >= 0 ? house - heaters[ind - 1] : Integer.MAX_VALUE;
+            int d2 = ind < heaters.length ? heaters[ind] - house : Integer.MAX_VALUE;
+        
+            max = Math.max(max, Math.min(d1, d2));
+        }
+        
+        return max;
+    }
+}
diff --git a/Easy/Pascal's Triangle II.java b/Easy/Pascal's Triangle II.java
@@ -0,0 +1,14 @@
+class Solution {
+    public List<Integer> getRow(int rowIndex) {
+        List<Integer> res = new ArrayList<Integer>();
+        
+        for(int i = 0;i<rowIndex+1;i++) {
+            res.add(1);
+            for(int j=i-1;j>0;j--) {
+                res.set(j, res.get(j-1) + res.get(j));
+            }
+        }
+        
+        return res;
+    }
+}
diff --git a/Easy/Pascal's Triangle.java b/Easy/Pascal's Triangle.java
@@ -0,0 +1,23 @@
+class Solution {
+   
+    public List<List<Integer>> generate(int numRows) {
+   
+        List<List<Integer>> ans = new ArrayList<>();
+        
+        for (int i=0;i<numRows;i++) {
+            List<Integer> temp = new ArrayList<>();
+            for(int j = 0;j<=i;j++) {
+                if (i == j || j == 0) {
+                    temp.add(1);
+                }
+                else {
+                    temp.add(ans.get(i-1).get(j-1) + ans.get(i-1).get(j));
+                }
+            }
+            
+            ans.add(temp);
+        }
+        
+        return ans;
+    }
+}
diff --git a/Easy/String Compression.java b/Easy/String Compression.java
@@ -0,0 +1,27 @@
+class Solution {
+    public int compress(char[] chars) {
+        
+        int ans = 0;
+        int ind = 0;
+        
+        while (ind < chars.length) {
+            char currChar = chars[ind];
+            int count = 0;
+            
+            while(ind < chars.length && chars[ind] == currChar) {
+                ind++;
+                count++;
+            }
+            
+            chars[ans++] = currChar;
+            
+            if (count != 1) {
+                for (char c : Integer.toString(count).toCharArray()) {
+                    chars[ans++] = c;
+                }
+            }
+        }
+        
+        return ans;
+    }
+}
