issues Search Results · repo:youngyangyang04/leetcode-master language:Shell
Filter by
274 results
(65 ms)274 results
inyoungyangyang04/leetcode-master (press backspace or delete to remove)本题提供了两种dp定义：
- dp[i][j]表示以i-1结尾的数组1和以j-1为结尾的数组2的最长重复子数组
- dp[i][j]表示以i结尾的数组1和以j为结尾的数组2的最长重复子数组
每种定义有不同的写法。但不论是哪一种，根据代码计算出来的dp[i][j]都不符合它的定义。 这里以第二种为例，以下是第二种定义对应的代码：
class Solution {
public:
...
Aapolaris
- Opened 3 days ago
- #2981
题目链接
《代码随想录》网站链接
这道题，随想录提到只能用后序遍历做。
实际上还可以用层次遍历，但是要开辟额外的空间。相比较后序遍历，算是一种次优解吧。
class Solution {
public:
bool isSymmetric(TreeNode* root) {
queue struct TreeNode* q;
q.push(root); ...
- Opened 28 days ago
- #2973
卡码网 Go sdk 版本过低，很多常用的新特性无法使用
例如
for range loopCnt {
// loop...
}
for i := range loopCnt {
// loop...
}
ans = max(ans, cur)
希望可以改进，感谢！
161043261
- Opened on Sep 9
- #2968
代码随想录网站-- 二叉树题目《30.删除二叉搜索树中的节点》-- 其他语言题解-- Java语言的第二份题解，应为“迭代法”而不是“递归法” img width= 1237 height= 761 alt= Image src=
https://github.com/user-attachments/assets/f59ac139-32b9-4ab7-9700-f240cd27bb8d /
Karry2021
- Opened on Aug 2
- #2962
Culaccino00这道题目的意思应该是计算孤岛个数吧，根据题意， 对于 5 6 1 1 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 这个输入，应该输出是1.
但是按照卡哥的代码，输出会是2，问题就出在应该是找到==1的陆地后，继续进行dfs，而不是直接count++
Jay-Chou118
- 3
- Opened on Jul 12
- #2957
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
StringBuilder sb = new ...
stahol-14
- Opened on Jul 9
- #2956
https://github.com/youngyangyang04/leetcode-master/blob/master/problems/0028.%E5%AE%9E%E7%8E%B0strStr.md “再来看一下如何利用
前缀表找到 当字符不匹配的时候应该指针应该移动的位置。如动画所示：” 下面的图有问题
luchao2424631502
- Opened on Jul 2
- #2951
也是使用滑动窗口方法.
class Solution:
def minSubArrayLen(self, target: int, nums: List[int]) - int:
i = 0
j = 0
s = 0
r = len(nums) + 1 # a sufficient large number to indicate ...
LogicFan
- Opened on Jun 3
- #2946
目前版本的【输入示例】： 3 3 1 2 3 2 1 3 1 2 3
按照解题思路和解题代码，【输入示例】是否应该为： 3 3 1 2 3 2 1 3 1 2 3
boat2moon
- Opened on May 31
- #2945
Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Press the /
key to activate the search input again and adjust your query.Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Press the /
key to activate the search input again and adjust your query.