10.leetcode Delete Columns to Make Sorted

brianway 发布于2019-07-31 10:17 / 3345人阅读

摘要：题目就是给一个数组，把每一项的对应的组合成一个新的数组，再算出那些不是递增的个数。例子我的算法其他算法思路跟我的差不多，只不过用了的

题目

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, A1, ..., AA.length-1].)

Suppose we chose a set of deletion indices D such that after deletions, each remaining column in A is in non-decreasing sorted order.
就是给一个数组，把每一项的对应的index组合成一个新的数组，再算出那些不是递增的个数。
Return the minimum possible value of D.length.

例子

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.

Input: ["a","b"]
Output: 0
Explanation: D = {}

Input: ["zyx","wvu","tsr"]
Output: 3
Explanation: D = {0, 1, 2}

我的算法

var minDeletionSize = function(A) {
    const b = A.map(v => v.split(""))
    let len = A.length
    let len2 = b[0].length
    let n = 0
    for (var i=0;i b[j+1][i]){
                n++
                break
            }
        }
    }
    return n
};

Runtime: 88 ms, faster than 64.27% of JavaScript online submissions for Delete Columns to Make Sorted.
Memory Usage: 43.9 MB, less than 7.69% of JavaScript online submissions for Delete Columns to Make Sorted.

其他算法

class Solution:
    def minDeletionSize(self, A):
        return sum(any(a[j] > b[j] for a, b in zip(A, A[1:])) for j in range(len(A[0])))

思路跟我的差不多，只不过用了python的zip api

GPU云服务器云服务器 columns Sorted sorted-array sorted_set

文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。

转载请注明本文地址：https://www.ucloud.cn/yun/43587.html

10.leetcode 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 indice...

littlelightss 2019-08-23 16:56 评论0 收藏0
前端 | 每天一个 LeetCode

摘要：在线网站地址我的微信公众号完整题目列表从年月日起，每天更新一题，顺序从易到难，目前已更新个题。这是项目地址欢迎一起交流学习。这篇文章记录我练习的 LeetCode 题目，语言 JavaScript。在线网站：https://cattle.w3fun.com GitHub 地址：https://github.com/swpuLeo/ca...我的微信公众号： showImg(htt...

张汉庆 2019-08-23 13:42 评论0 收藏0