wx5be5864e766ab的博客_java

Test123

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

Math

i++

原创 2024-09-05 09:48:03 25 阅读

lc-2222

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;

i++

原创 2024-09-04 14:02:52 41 阅读

lc-188

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

Math

i++

原创 2024-09-03 15:00:18 54 阅读

lc-960

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;

Math

i++

原创 2024-09-02 10:15:45 27 阅读

lc-1691

public int maxHeight(int[][] cuboids) { int n = cuboids.length; for (int i = 0; i < n; i++) { Arrays.sort(cuboids[i]); } Arrays.sort(cuboids,(a,b)->{ return a[0]

i++

Math

原创 2024-08-30 10:10:08 40 阅读

tz_member_prod

CREATE TABLE `tz_member_prod` ( `prod_id` bigint(20) unsigned NOT NULL AUTO_INCREMENT COMMENT '商品ID', `prod_name` varchar(255) DEFAULT NULL COMMENT '商品名称', `prod_name_py` varchar(255

版本号

修改时间

原创 2024-08-29 16:12:56 97 阅读

tz_member_order_settlement

CREATE TABLE `tz_member_order_settlement` ( `settlement_id` bigint(20) unsigned NOT NULL AUTO_INCREMENT COMMENT '支付结算单据ID', `pay_no` varchar(36) DEFAULT NULL COMMENT '支付单号', `biz_

微信支付

版本号

支付宝

原创 2024-08-29 14:57:51 41 阅读

lc-1626

public int bestTeamScore(int[] scores, int[] ages) { int n = scores.length; Integer[] idxArray = new Integer[n]; for (int i = 0; i < n; i++) { idxArray[i] = i; } Arrays

i++

Math

List

原创 2024-08-28 10:53:44 43 阅读

lc-2111

public int kIncreasing(int[] arr, int k) { int ans = 0; int n = arr.length; for (int i = 0; i < k; i++) { int maxLen = 0; List<Integer> list = new ArrayList<>

Math

List

i++

原创 2024-08-27 10:04:32 22 阅读

lc-26

public int removeDuplicates(int[] nums) { int pre = Integer.MIN_VALUE; int ans = 0; for (int num : nums) { if (pre != num) { ans++; } pre = num; }

java

原创 2024-08-23 15:45:52 21 阅读

lc-1964

public int[] longestObstacleCourseAtEachPosition(int[] obstacles) { int n = obstacles.length; int[] dp = new int[n + 1]; List<Integer> list = new ArrayList<>(); list.add(ob

List

i++

System

原创 2024-08-23 10:43:59 37 阅读

lc-1671

public int minimumMountainRemovals(int[] nums) { int n = nums.length; int[] left = new int[n]; int[] right = new int[n]; for (int i = 0; i < n; i++) { for (int j = i + 1; j

Math

i++

原创 2024-08-22 13:28:20 45 阅读

lc-2708

public long maxStrength(int[] nums) { int n = nums.length; int[][] dp = new int[2][n + 1]; dp[0][0] = 1; dp[1][0] = 1; for (int i = 0; i < n; i++) { dp[0][i + 1] = Math.

Math

i++

原创 2024-08-21 17:12:43 31 阅读

lc-1092

public String shortestCommonSupersequence(String str1, String str2) { char[] arr1 = str1.toCharArray(); char[] arr2 = str2.toCharArray(); int m = arr1.length; int n = arr2.length;

i++

Math

原创 2024-08-21 15:07:58 27 阅读

lc-1458

public int maxDotProduct(int[] nums1, int[] nums2) { int m = nums1.length; int n = nums2.length; int[][] dp = new int[2][n]; dp[0][0] = nums1[0] * nums2[0]; for (int j = 1; j <

Math

i++

原创 2024-08-20 09:37:33 26 阅读

lc-741

public int cherryPickup(int[][] grid) { int m = grid.length; int n = grid[0].length; int w = Math.max(m, n); int h = m + n -1; int[][] f = new int[w+1][w+1]; int[][] g = new in

Math

i++

原创 2024-08-19 17:52:11 20 阅读

lc-1463

public int cherryPickup(int[][] grid) { int m = grid.length; int n = grid[0].length; int[][] f = new int[n+2][n+2]; int[][] g = new int[n+2][n+2]; for (int i = m -1; i >= 0 ; i-

Math

原创 2024-08-16 16:14:22 28 阅读

lc-1049

public int lastStoneWeightII(int[] stones) { int m = stones.length; int sum = 0; for (int stone : stones) { sum += stone; } int half = sum /2 ; boolean[] dp = new boole

i++

原创 2024-08-15 10:03:25 23 阅读

lc-1937

public long maxPoints(int[][] points) { int m = points.length; int n = points[0].length; int INF = -0x3f3f3f3f; int[][] dp = new int[m][n]; for (int j = 0; j < n; j++) {

Math

i++

原创 2024-08-14 10:14:07 24 阅读

lc-2267

public boolean hasValidPath(char[][] grid) { int m = grid.length; int n = grid[0].length; if ((m + n) % 2 == 0) { return false; } if (grid[0][0] == ')') { return fa

i++

原创 2024-08-13 09:45:43 40 阅读

lc-2328

private int ans = 0; private int[][][] count; private int mod = 1_000_000_007; public int countPaths(int[][] grid) { int m = grid.length; int n = grid[0].length; count = new int[m][n][2];

i++

原创 2024-08-12 10:32:10 28 阅读

lc-2110

public long getDescentPeriods(int[] prices) { List<Integer> list = new ArrayList<>(); int n = prices.length; int continuous = 1; for (int i = 1; i < n; i++) { if

i++

List

原创 2024-08-08 11:41:29 23 阅读

lc-2435

public int numberOfPaths(int[][] grid, int k) { int mod = 1_000_000_007; int m = grid.length; int n = grid[0].length; int[][][] dp = new int[m][n][k]; int sum = grid[0][0] %k;

i++

原创 2024-08-07 10:08:43 39 阅读

lc-1301

public int[] pathsWithMaxScore(List<String> board) { int m = board.size(); int n = board.get(0).length(); int mod = 1_000_000_007; int[][] grid = new int[m][n]; for (int i =

i++

List

原创 2024-08-06 10:23:58 25 阅读

LCR-166

public int jewelleryValue(int[][] frame) { int m = frame.length; int n = frame[0].length; int[][] dp = new int[m][n]; dp[0][0] = frame[0][0]; for (int i = 1; i < n; i++) {

i++

Math

原创 2024-08-06 09:16:51 42 阅读

lc-2466

public int countGoodStrings(int low, int high, int zero, int one) { int mod = 1_000_000_007; int[] dp = new int[high + 1]; dp[0] = 1; for (int i = 1; i <= high; i++) { if (i

i++

原创 2024-08-05 09:20:55 50 阅读

lc-1289

public int minFallingPathSum(int[][] grid) { int m = grid.length; int n = grid[0].length; int[][] dp = new int[m][n]; int ans = Integer.MAX_VALUE; if (n == 1) { return -1;

i++

Math

原创 2024-08-02 10:27:25 36 阅读

lc-2684

public int maxMoves(int[][] grid) { int m = grid.length; int n = grid[0].length; int[][] dp = new int[m][n]; int ans = 1; for (int i = 0; i < m; i++) { dp[i][0] = 1;

Math

i++

原创 2024-08-01 09:49:47 48 阅读

lc-2266

public int countTexts(String pressedKeys) { int n = pressedKeys.length(); List<Integer> list = new ArrayList<>(); char p = pressedKeys.charAt(0); int count = 1; for (in

sed

i++

List

原创 2024-07-31 10:24:28 40 阅读

lc-2826

public int minimumOperations(List<Integer> nums) { int n = nums.size(); int[][] dp = new int[n][3]; for (int i = nums.get(0) - 1; i < 3; i++) { dp[0][i] = 1; } for

Math

i++

List

原创 2024-07-30 15:24:49 24 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

wx5be5864e766ab的博客

Test123

lc-2222

lc-188

lc-960

lc-1691

tz_member_prod

tz_member_order_settlement

lc-1626

lc-2111

lc-26

lc-1964

lc-1671

lc-2708

lc-1092

lc-1458

lc-741

lc-1463

lc-1049

lc-1937

lc-2267

lc-2328

lc-2110

lc-2435

lc-1301

LCR-166

lc-2466

lc-1289

lc-2684

lc-2266

lc-2826

欢迎