回文串_动态规划_回文数字 动态规划

import java.util.Scanner;

public class 回文串_动态规划 {
    public static void main(String[] args) {
        String s;
        Scanner scanner=new Scanner(System.in);
        s=scanner.next();
        System.out.println(minInsertions(s));
    }


    public static int minInsertions(String s) {
        int n = s.length();
        char []arry=new char[n];
        arry=s.toCharArray();
       int []dp=new int[n];

        int temp = 0;

        for (int i = n - 2; i >= 0; i--) {
// 记录 dp[i+1][j-1]

            int pre = 0;

            for (int j = i + 1; j < n; j++) {
                temp = dp[j];

                if (arry[i] == arry[j]) {
// dp[i][j] = dp[i+1][j-1];

                    dp[j] = pre;

                } else {
// dp[i][j] = min(dp[i+1][j], dp[i][j-1]) + 1;

                    dp[j] =Math.min(dp[j], dp[j - 1]) + 1;

                }

                pre = temp;

            }

        }

        return dp[n - 1];

    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

参考了这位博主的文章https://blog.csdn.net/weixin_39914868/article/details/114280581