Added 1 solution & modified 1 solution

varunu28 · varunu28 · commit 32207f5dba71 · 2020-04-22T12:15:30.000-07:00
diff --git a/Easy/Palindrome Permutation.java b/Easy/Palindrome Permutation.java
@@ -1,24 +1,18 @@
 class Solution {
-    public static boolean canPermutePalindrome(String s) {
-        Map<Character, Integer> map = new HashMap<>();
-        char[] chars = s.toCharArray();
-        
-        for (char c : chars) {
-            map.put(c, map.getOrDefault(c, 0) + 1);
-        }
-        
-        int oddVal = 0;
-        
-        for (Map.Entry<Character, Integer> entry : map.entrySet()) {
-            if (entry.getValue()%2 != 0) {
-                oddVal++;
-            }
-            
-            if (oddVal == 2) {
-                return false;
-            }
+  public boolean canPermutePalindrome(String s) {
+    Map<Character, Integer> map = new HashMap<>();
+    for (char c : s.toCharArray()) {
+      map.put(c, map.getOrDefault(c, 0) + 1);
+    }
+    boolean oddFound = false;
+    for (Character key : map.keySet()) {
+      if (map.get(key) % 2 != 0) {
+        if (oddFound) {
+          return false;
         }
-        
-        return true;
+        oddFound = true;
+      }
     }
+    return true;
+  }
 }
diff --git a/Medium/Leftmost Column with at Least a One.java b/Medium/Leftmost Column with at Least a One.java
@@ -0,0 +1,39 @@
+/**
+ * // This is the BinaryMatrix's API interface.
+ * // You should not implement it, or speculate about its implementation
+ * interface BinaryMatrix {
+ *     public int get(int x, int y) {}
+ *     public List<Integer> dimensions {}
+ * };
+ */
+
+class Solution {
+  public int leftMostColumnWithOne(BinaryMatrix binaryMatrix) {
+    List<Integer> dims = binaryMatrix.dimensions();
+    int rows = dims.get(0);
+    int cols = dims.get(1);
+    int minIdx = Integer.MAX_VALUE;
+    for (int i = 0; i < rows; i++) {
+      int idx = binarySearch(binaryMatrix, i, 0, cols - 1);
+      if (idx != -1) {
+        minIdx = Math.min(minIdx, idx);
+      }
+    }
+    return minIdx == Integer.MAX_VALUE ? -1 : minIdx;
+  }
+  
+  private int binarySearch(BinaryMatrix binaryMatrix, int row, int start, int end) {
+    int minIdx = Integer.MAX_VALUE;
+    while (start <= end) {
+      int mid = (start + end) / 2;
+      if (binaryMatrix.get(row, mid) == 1) {
+        minIdx = Math.min(minIdx, mid);
+        end = mid - 1;
+      }
+      else {
+        start = mid + 1;
+      }
+    }
+    return minIdx == Integer.MAX_VALUE ? -1 : minIdx;
+  }
+}
