refactor 944

fishercoder1534 · fishercoder1534 · commit 0f2107385a56 · 2020-08-01T17:24:25.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_944.java b/src/main/java/com/fishercoder/solutions/_944.java
@@ -1,58 +1,21 @@
 package com.fishercoder.solutions;
 
-/**
- * 944. Delete Columns to Make Sorted
- *
- * We are given an array A of N lowercase letter strings, all of the same length.
- * Now, we may choose any set of deletion indices, and for each string, we delete all the characters in those indices.
- * For example, if we have an array A = ["abcdef","uvwxyz"] and deletion indices {0, 2, 3},
- * then the final array after deletions is ["bef", "vyz"], and the remaining columns of A are ["b","v"], ["e","y"],
- * and ["f","z"].  (Formally, the c-th column is [A[0][c], A[1][c], ..., A[A.length-1][c]].)
- *
- * Suppose we chose a set of deletion indices D such that after deletions, each remaining column in A is in non-decreasing sorted order.
- *
- * Return the minimum possible value of D.length.
- *
- * Example 1:
- *
- * Input: ["cba","daf","ghi"]
- * Output: 1
- * Explanation:
- * After choosing D = {1}, each column ["c","d","g"] and ["a","f","i"] are in non-decreasing sorted order.
- * If we chose D = {}, then a column ["b","a","h"] would not be in non-decreasing sorted order.
- * Example 2:
- *
- * Input: ["a","b"]
- * Output: 0
- * Explanation: D = {}
- * Example 3:
- *
- * Input: ["zyx","wvu","tsr"]
- * Output: 3
- * Explanation: D = {0, 1, 2}
- *
- *
- * Note:
- *
- * 1 <= A.length <= 100
- * 1 <= A[i].length <= 1000
- * */
 public class _944 {
-  public static class Solution1 {
-    public int minDeletionSize(String[] A) {
-      if (A == null || A.length == 0) {
-        return 0;
-      }
-      int deletion = 0;
-      for (int i = 0; i < A[0].length(); i++) {
-        for (int j = 0; j < A.length - 1; j++) {
-          if (A[j].charAt(i) > A[j + 1].charAt(i)) {
-            deletion++;
-            break;
-          }
+    public static class Solution1 {
+        public int minDeletionSize(String[] A) {
+            if (A == null || A.length == 0) {
+                return 0;
+            }
+            int deletion = 0;
+            for (int i = 0; i < A[0].length(); i++) {
+                for (int j = 0; j < A.length - 1; j++) {
+                    if (A[j].charAt(i) > A[j + 1].charAt(i)) {
+                        deletion++;
+                        break;
+                    }
+                }
+            }
+            return deletion;
         }
-      }
-      return deletion;
     }
-  }
 }
