leetcode removing string stars
Leetcode 160. 链表相交(Intersection of two linked lists lcci)
[题目链接](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/description) 给定两个单链表的头节点headA和headB, 请找出并返回两个单链表相交的起始节点. 如果两个链表没有交点, 返回null. ......
Mike and strings 题解
[题目传送门](https://www.luogu.com.cn/problem/CF798B) 一道字符串题。 由于 $n$ 非常小，可以暴力枚举字符串。我们可以枚举其中一个字符串 $s_i$，然后让其他的字符串变成 $s_i$，最后记录一下次数，取一个最小值即可。 在枚举第二个字符串的时候可以将 ......
Leetcode 1388. 3n 块披萨
（本文只提供了解题思路的思考，[原文作者题解连接](https://leetcode.cn/problems/pizza-with-3n-slices/solutions/527304/dpjie-fa-yu-da-jia-jie-she-2-de-chai-bie-ihso/)) 先把题目粘贴在这 ......
leetcode1372dp求交错路径长
bfd+dp unordered_map<TreeNode* ,int>d,p; queue<pair<TreeNode* ,TreeNode*>>q; int dp(TreeNode* root){ d[root]=p[root]=0; q.push({root,nullptr}); while( ......
[LeetCode][70]climbing-stairs
# Content You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can ......
[LeetCode][53]maximum-subarray
# Content Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Ou ......
[LeetCode][55]jump-game
# Content You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your ......
[LeetCode][62]unique-paths
# Content There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the ......
[LeetCode][42]trapping-rain-water
# Content Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raini ......
[LeetCode][10]regular-expression-matching
# Content Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where: '.' Matches any single ch ......
[LeetCode][32]longest-valid-parentheses
# Content Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. Examp ......
[LeetCode][64]minimum-path-sum
# Content Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along ......
LeetCode[10]RegularExpressionMatching
# Content Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where: '.' Matches any single ch ......
LeetCode[32]LongestValidParentheses
# Content Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. Examp ......
LeetCode[42]TrappingRainWater
# Content Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raini ......
LeetCode[53]MaximumSubarray
# Content Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Ou ......
LeetCode[62]UniquePaths
# Content There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the ......
LeetCode[55]JumpGame
# Content You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your ......
LeetCode[64]MinimumPathSum
# Content Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along ......
10.4K Star！程序员为程序员针对性优化的开源免费笔记
平时我一直用Notion来记录内容为主，但也一直关注着其他开源产品。上周正好看到一款非常受欢迎的开源免费笔记，今天就推荐给大家：[**VNote**](https://blog.didispace.com/tj-opensource-vnote/)。  time complexity? 一开始想过用map，但是不能解决重复key的问题。 然而我用sort， ......
redis：string类型
学习自：Redis 的五种数据类型及其底层原理_redis的五种数据类型_ZJE_ANDY的博客-CSDN博客 Redis 的五种基本数据类型_redis的五种数据类型_喵先森爱吃鱼的博客-CSDN博客 Redis是K-V结构的数据库。 Redis有5种常用数据类型（这里的数据类型，都是针对K-V对 ......
String和Integer
# Integer 记录一下int和Integer之间相互比较的关系 ## Int和Integer 在java 5中引入了自动装箱和自动拆箱功能（boxing/unboxing），java可以根据上下文，自动进行转换，极大地简化了相关编程。javac自动把装箱转换为Integer.valueOf() ......
Unable to start activity Comandroid.content.res.Resources$NotFoundException: String resource ID #0x0
Unable to start activity Comandroid.content.res.Resources$NotFoundException: String resource ID #0x0 打开app->res->values->strings.xml文件添加 <string name= ......
LeetCode 1581. 进店却未进行过交易的顾客
##题目 表：Visits ```sql + + + | Column Name | Type | + + + | visit_id | int | | customer_id | int | + + + visit_id 是该表中具有唯一值的列。 该表包含有关光临过购物中心的顾客的信息。 ``` ......
Leetcode 19. 删除链表的倒数第N个结点(Remove nth node from end of list)
[题目链接](https://leetcode.cn/problems/remove-nth-node-from-end-of-list) 给你一个链表, 删除链表的倒数第n个结点, 并且返回链表的头结点. 示例 1: ``` 输入：head = [1,2,3,4,5], n = 2 输出：[1,2 ......
Leetcode148 排序链表
148. 排序链表 - 力扣（LeetCode） /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr ......
对于Java中String的简单理解
## String的三种初始化方式 ```java public class Test { public static void main(String[] args) { String str1 = "Hello, World !"; //直接初始化 String str2 = new Strin ......