国产xxxx99真实实拍_久久不雅视频_高清韩国a级特黄毛片_嗯老师别我我受不了了小说

資訊專欄INFORMATION COLUMN

10.leetcode Delete Columns to Make Sorted

brianway / 3366人閱讀

摘要:題目就是給一個數組,把每一項的對應的組合成一個新的數組,再算出那些不是遞增的個數。例子我的算法其他算法思路跟我的差不多,只不過用了的

題目

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

文章版權歸作者所有,未經允許請勿轉載,若此文章存在違規行為,您可以聯系管理員刪除。

轉載請注明本文地址:http://specialneedsforspecialkids.com/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 評論0 收藏0
  • 前端 | 每天一個 LeetCode

    摘要:在線網站地址我的微信公眾號完整題目列表從年月日起,每天更新一題,順序從易到難,目前已更新個題。這是項目地址歡迎一起交流學習。 這篇文章記錄我練習的 LeetCode 題目,語言 JavaScript。 在線網站:https://cattle.w3fun.com GitHub 地址:https://github.com/swpuLeo/ca...我的微信公眾號: showImg(htt...

    張漢慶 評論0 收藏0

發表評論

0條評論

brianway

|高級講師

TA的文章

閱讀更多
最新活動
閱讀需要支付1元查看
<