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. 1 <= A.length <= 100
2. 1 <= A[i].length <= 1000

class Solution:
    def minDeletionSize(self, A):
        count = 0
        for items in zip(*A):  # The * operator can be used in conjuncton with zip() to unzip the list.
            if sorted(items) != list(items):
                count += 1
                
        return count

下面的找问题：["a","b"]=>0;  ["cba","daf","ghi"]=>1

["rrjk","furt","guzm"]=>2,我的是1 ；

class Solution:
    def minDeletionSize(self, A):
        """
        :type A: List[str]
        :rtype: int
        """
        count=0
        for c in range (len(A[0])):
            for j in range(1,len(A)):
                if A[j-1][c]>A[j][c]:
                    count=count+1
                break
        return count

 

 

Reference:

zip() :http://www.runoob.com/python/python-func-zip.html