qq_60225495的博客

回文数

quwan

dp

dp

dp

dpdpdpdpdp

dp

dp超详细，动态规划解法

dp

dp

dp

dp

dp

dp

dp

dp

dp

dp

回溯

二分查找最小元素

1111111111

剑指OFFER09

二进制求和

package com.company;import java.util.ArrayList;import java.util.*;import java.util.Scanner;public class quicksort { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); List&l

https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/solution/mian-shi-ti-03-shu-zu-zhong-zhong-fu-de-shu-zi-yua/class Solution { public int findRepeatNumber(int[] nums) { Set<Integer> dic = new HashSet<>(); .

https://leetcode.cn/problems/basic-calculator/solution/ji-ben-ji-suan-qi-by-leetcode-solution-jvir/class Solution { public int calculate(String s) { // ops作为栈，存储sign值（1或-1），sign用来指代+-号 Deque<Integer> ops = new ArrayDeque<&g.

package com.LeetCode_ACM;import java.util.HashMap;import java.util.Map;import java.util.Scanner;public class lc_03 { public static void main (String[] args){ Scanner in = new Scanner(System.in); String s = in.next(); int.

1 dp

1 dp

https://leetcode-cn.com/problems/target-sum/solution/huan-yi-xia-jiao-du-ke-yi-zhuan-huan-wei-dian-xing/class Solution { public int findTargetSumWays(int[] nums, int target) { int sum = 0; for(int i = 0; i < nums.length; i++){ .

1049. 最后一块石头的重量 II1 dp1 dp返回石头的最小可能重量，而如果石头分成重量相同的两堆，每次取石头时分别从两堆石头中各取一个，因为两堆石头重量尽可能地相同，则最后剩下的石头的重量也会尽可能地小。故此题转化为求将石头转入容量为sum/2（石头堆重量/2）的背包中，所能获得的最大价值（最大石头重量）。https://programmercarl.com/1049.%E6%9C%80%E5%90%8E%E4%B8%80%E5%9D%97%E7%9F%B3%E5%A4%B4%E7%9A%

416. 分割等和子集1 DP1 DP

有n件物品和一个最多能背重量为w的背包。第i件物品的重量是weight[i]，得到的价值是value[i] 。每件物品只能用一次，求解将哪些物品装入背包里物品价值总和最大？1 dphttps://programmercarl.com/%E8%83%8C%E5%8C%85%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%8001%E8%83%8C%E5%8C%85-1.html#_01-%E8%83%8C%E5%8C%85...

96. 不同的二叉搜索树DPDP

63. 不同路径 IIhttps://leetcode-cn.com/problems/unique-paths-ii/package com.LeetCode_ACM;import java.util.Scanner;public class lc63 { public static void main(String[] args){ Scanner in = new Scanner(System.in); int m = in.nextInt();

62. 不同路径1 dphttps://leetcode-cn.com/problems/unique-paths/1 dp

746. 使用最小花费爬楼梯1 dp1 dphttps://programmercarl.com/0746.%E4%BD%BF%E7%94%A8%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9%E7%88%AC%E6%A5%BC%E6%A2%AF.html#%E6%80%9D%E8%B7%AFpackage com;import java.util.Scanner;public class lc_746 { public static void main(

70. 爬楼梯1 dp1 dp

509. 斐波那契数1 递归2 DP五部曲1 递归package com.LeetCode_ACM;import java.util.Scanner;public class lc509 { public static void main(String[] args){ Scanner in = new Scanner(System.in); int n = in.nextInt(); System.out.println(fib(n))

376. 摆动序列package com.LeetCode_ACM;import java.util.Scanner;public class lc376 { public static void main(String[] args){ Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] nums = new int[n]; for(int i