代码拉取完成，页面将自动刷新
同步操作将从 doocs/leetcode 强制同步，此操作会覆盖自 Fork 仓库以来所做的任何修改，且无法恢复！！！
确定后同步将在后台操作，完成时将刷新页面，请耐心等待。
You are given an array of n strings strs, all of the same length.
We may choose any deletion indices, and we delete all the characters in those indices for each string.
For example, if we have strs = ["abcdef","uvwxyz"] and deletion indices {0, 2, 3}, then the final array after deletions is ["bef", "vyz"].
Suppose we chose a set of deletion indices answer such that after deletions, the final array has every string (row) in lexicographic order. (i.e., (strs[0][0] <= strs[0][1] <= ... <= strs[0][strs[0].length - 1]), and (strs[1][0] <= strs[1][1] <= ... <= strs[1][strs[1].length - 1]), and so on). Return the minimum possible value of answer.length.
Example 1:
Input: strs = ["babca","bbazb"] Output: 3 Explanation: After deleting columns 0, 1, and 4, the final array is strs = ["bc", "az"]. Both these rows are individually in lexicographic order (ie. strs[0][0] <= strs[0][1] and strs[1][0] <= strs[1][1]). Note that strs[0] > strs[1] - the array strs is not necessarily in lexicographic order.
Example 2:
Input: strs = ["edcba"] Output: 4 Explanation: If we delete less than 4 columns, the only row will not be lexicographically sorted.
Example 3:
Input: strs = ["ghi","def","abc"] Output: 0 Explanation: All rows are already lexicographically sorted.
Constraints:
n == strs.length1 <= n <= 1001 <= strs[i].length <= 100strs[i] consists of lowercase English letters.class Solution:
def minDeletionSize(self, strs: List[str]) -> int:
n = len(strs[0])
dp = [1] * n
for i in range(1, n):
for j in range(i):
if all(s[j] <= s[i] for s in strs):
dp[i] = max(dp[i], dp[j] + 1)
return n - max(dp)
class Solution {
public int minDeletionSize(String[] strs) {
int n = strs[0].length();
int[] dp = new int[n];
Arrays.fill(dp, 1);
int mx = 1;
for (int i = 1; i < n; ++i) {
for (int j = 0; j < i; ++j) {
if (check(i, j, strs)) {
dp[i] = Math.max(dp[i], dp[j] + 1);
}
}
mx = Math.max(mx, dp[i]);
}
return n - mx;
}
private boolean check(int i, int j, String[] strs) {
for (String s : strs) {
if (s.charAt(i) < s.charAt(j)) {
return false;
}
}
return true;
}
}
class Solution {
public:
int minDeletionSize(vector<string>& strs) {
int n = strs[0].size();
vector<int> dp(n, 1);
int mx = 1;
for (int i = 1; i < n; ++i) {
for (int j = 0; j < i; ++j) {
if (check(i, j, strs)) {
dp[i] = max(dp[i], dp[j] + 1);
}
}
mx = max(mx, dp[i]);
}
return n - mx;
}
bool check(int i, int j, vector<string>& strs) {
for (string& s : strs)
if (s[i] < s[j])
return false;
return true;
}
};
func minDeletionSize(strs []string) int {
n := len(strs[0])
dp := make([]int, n)
mx := 1
dp[0] = 1
check := func(i, j int) bool {
for _, s := range strs {
if s[i] < s[j] {
return false
}
}
return true
}
for i := 1; i < n; i++ {
dp[i] = 1
for j := 0; j < i; j++ {
if check(i, j) {
dp[i] = max(dp[i], dp[j]+1)
}
}
mx = max(mx, dp[i])
}
return n - mx
}
此处可能存在不合适展示的内容，页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容，可点击提交进行申诉，我们将尽快为您处理。