Dane_liya的博客

爬虫小白在b站看的视频教程，爬取的是网易云音乐的歌曲热评。本文仅用于学习记录，不用作任何商业用途。本文最后附带源代码和运行效果图。1.安装库import requestsfrom Crypto.Cipher import AESfrom base64 import b64encodeimport json这里有一个小坑，就是这个Crypto。如果电脑中的site-packages中已经带有crypto的话，先把它删除！然后我们再通过pip install pycryptodome来安装

1.题目2.解法①字符串、哈希表+循环public class Solution { public int longestPalindrome(String s) { int res = 0; int n = s.length(); if(n == 0) return 0; int flag = 0; Map<Character, Integer> map = new HashMap<>(

1.题目2.解法①一维数组+dfspublic class Solution { public List<List<Integer>> kSumII(int[] A, int k, int target) { List<List<Integer>> res = new ArrayList<>(); List<Integer> temp = new ArrayList<>();

1.题目2.解法①一维数组+双指针public class Solution { public int trapRainWater(int[] heights) { int res = 0; int l = 0; int r; int n = heights.length; for(int i = 0; i < n; i++){ if(heights[i] != 0){

1.题目2.解法①字符串，一维数组+双指针

1.题目2.解法①二维数组+动态规划public class Solution { public int copyBooks(int[] pages, int k) { int n = pages.length; if(n == 0) return 0; if(k > n) k = n; int[][] dp = new int[k+1][n+1]; int[] sums = new int[n+

1.题目2.解法①可变字符串+循环public class Solution { public List<String> printX(int n) { List<String> res = new ArrayList<>(); int l = 0; int r = n - 1; while(l < n && r >= 0){ St

1.题目2.解法①一维数组+排序、动态规划class Solution { public int findLongestChain(int[][] pairs) { int n = pairs.length; int[] dp = new int[n]; Arrays.fill(dp, 1); Arrays.sort(pairs, (a, b) -> (a[0] - b[0])); for(in

1.题目2.

1.题目

1.题目2.解法①一维数组+动态规划class Solution { public int lengthOfLIS(int[] nums) { int n = nums.length; if(n == 0) return 0; int[] dp = new int[n]; dp[0] = 1; int res = 1; for(int i = 1; i < n; i++){

1.题目2.解法①一维数组+动态规划

1.题目2.解法①一维数组+动态规划class Solution { public int integerBreak(int n) { if(n == 2) return 1; if(n == 3) return 2; int[] dp = new int[n + 1]; for(int i = 2; i <= n; i++){ dp[i] = i; for(int j =

1.题目2.解法①二维数组+动态规划class Solution { public int maximalSquare(char[][] matrix) { if(matrix.length == 0 || matrix[0].length == 0) return 0; int r = matrix.length; int c = matrix[0].length; int[][] dp = new int[r][c];

1.题目2.解法①一维数组+动态规划class Solution { public int rob(int[] nums) { int n = nums.length; if(n == 1) return nums[0]; if(n == 2) return Math.max(nums[0], nums[1]); int[] dp = new int[n]; dp[0] = nums[0]; d

1.题目2.解法①一维数组+动态规划class Solution { public int numDecodings(String s) { int n = s.length(); int[] dp = new int[n]; if(s.charAt(0) == '0') return 0; dp[0] = 1; for(int i = 1; i < n; i++){ if(s.c

1.题目2.解法①一维数组+动态规划class Solution { public int coinChange(int[] coins, int amount) { int[] dp = new int[amount + 1]; Arrays.fill(dp, Integer.MAX_VALUE); dp[0] = 0; for(int i = 0; i < amount; i++){ if(d

1.题目2.解法①队列+

1.题目2.解法二维数组+

1.题目2.解法①e