public int maxPrifit(int[] prices) { int n = prices.length; int ans = 0; int[][][] dp = new int[2][3][2]; int INF = Integer.MIN_VALUE/2; for (int i = 0; i < 2; i++) { dp
public long numberOfWays(String s) { char[] array = s.toCharArray(); int n = array.length; long[][][] dp = new long[n][4][2]; for (int i = 0; i < n; i++) { dp[i][0][1] = 1;
public int maxProfit(int k, int[] prices) { int n = prices.length; if (n == 1) { return 0; } int[][][] dp = new int[n][k + 1][2]; int ans = 0; int INF = Integer.MIN_VAL
public int minDeletionSize(String[] strs) { int m = strs.length; int n = strs[0].length(); int[] dp = new int[n]; int ans = 0; for (int i = 0; i < n; i++) { dp[i] = 1;
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号