Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix code, to pass test case #2214

Merged
merged 8 commits into from
Jan 14, 2024
Merged

Fix code, to pass test case #2214

Changes from 1 commit
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
f46fa3c
Fix code, to pass test case
manoharreddyporeddy Jan 13, 2024
7cecd1e
Update README_EN.md
yanglbme Jan 14, 2024
249176d
Update README.md
yanglbme Jan 14, 2024
5729a1c
Update Solution.py
yanglbme Jan 14, 2024
5804e44
Update Solution.java
yanglbme Jan 14, 2024
17b6041
Update Solution.cpp
yanglbme Jan 14, 2024
e245fa3
Update Solution.go
yanglbme Jan 14, 2024
1e9ed3f
Update Solution.ts
yanglbme Jan 14, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Update Solution.ts
  • Loading branch information
@yanglbme
yanglbme authored Jan 14, 2024
commit 1e9ed3fa87f59d5ef8048e7db0c15b36796662bc
4 changes: 2 additions & 2 deletions solution/1400-1499/1483.Kth Ancestor of a Tree Node/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,8 +6,8 @@ class TreeAncestor {
for (let i = 0; i < n; ++i) {
p[i][0] = parent[i];
}
for (let i = 0; i < n; ++i) {
for (let j = 1; j < 18; ++j) {
for (let j = 1; j < 18; ++j) {
for (let i = 0; i < n; ++i) {
if (p[i][j - 1] === -1) {
continue;
}
Expand Down