資訊專(zhuān)欄INFORMATION COLUMN
摘要：題目就是給一個(gè)數(shù)組，把每一項(xiàng)的對(duì)應(yīng)的組合成一個(gè)新的數(shù)組，再算出那些不是遞增的個(gè)數(shù)。例子我的算法其他算法思路跟我的差不多，只不過(guò)用了的
題目
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.
就是給一個(gè)數(shù)組， 把每一項(xiàng)的對(duì)應(yīng)的index組合成一個(gè)新的數(shù)組，再算出那些不是遞增的個(gè)數(shù)。
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])))
思路跟我的差不多，只不過(guò)用了python的zip api
文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請(qǐng)注明本文地址：http://systransis.cn/yun/43587.html
摘要：題目就是給一個(gè)數(shù)組，把每一項(xiàng)的對(duì)應(yīng)的組合成一個(gè)新的數(shù)組，再算出那些不是遞增的個(gè)數(shù)。例子我的算法其他算法思路跟我的差不多，只不過(guò)用了的 題目 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...
摘要：在線網(wǎng)站地址我的微信公眾號(hào)完整題目列表從年月日起，每天更新一題，順序從易到難，目前已更新個(gè)題。這是項(xiàng)目地址歡迎一起交流學(xué)習(xí)。 這篇文章記錄我練習(xí)的 LeetCode 題目，語(yǔ)言 JavaScript。 在線網(wǎng)站：https://cattle.w3fun.com GitHub 地址：https://github.com/swpuLeo/ca...我的微信公眾號(hào)： showImg(htt...
閱讀 2613·2021-09-26 10:17
閱讀 3237·2021-09-22 15:16
閱讀 2146·2021-09-03 10:43
閱讀 3271·2019-08-30 11:23
閱讀 3667·2019-08-29 13:23
閱讀 1316·2019-08-29 11:31
閱讀 3699·2019-08-26 13:52
閱讀 1405·2019-08-26 12:22
