56.合并区间|72.编辑距离

最新推荐文章于 2024-09-12 19:02:20 发布

Avery51N0W

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量88

点赞数 2

文章标签：算法

本文链接：https://blog.csdn.net/Avery51N0W/article/details/141106766

版权

class Solution {
    public int[][] merge(int[][] intervals) {
        //排序
        Arrays.sort(intervals,(a,b) -> a[0]-b[0]);
        LinkedList<int[]> merged = new LinkedList<>();
        for(int[] interval:intervals){
            if(merged.isEmpty() || merged.getLast()[1] < interval[0]){
                merged.add(interval);
            }else{
                merged.getLast()[1] = Math.max(merged.getLast()[1],interval[1]);

            }
        }
        return merged.toArray(new int[merged.size()][]);
    }
}

class Solution {
    public int minDistance(String word1, String word2) {
        int m = word1.length();
        int n = word2.length();

        int[][] dp = new int[m+1][n+1];
        for(int i=0;i<=m;i++){
            dp[i][0]=i;
        }
        for(int i=0;i<=n;i++){
            dp[0][i]=i;
        }
        for(int i=1;i<=m;i++){
            for(int j=1;j<=n;j++){
                if(word1.charAt(i-1)!=word2.charAt(j-1)){
                    dp[i][j] = Math.min(dp[i-1][j],Math.min(dp[i-1][j-1],dp[i][j-1])) +1;
                }else{
                    dp[i][j]=dp[i-1][j-1];
                }
            }
        }
        return dp[m][n];
    }
}