root/notes
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

vault backup: 2022-09-07 21:30:22

Browse source
This commit is contained in:
juan 2022-09-07 21:30:22 +08:00
parent 8f8ff15ddb
commit 43cbacae45
2 changed files with 9 additions and 31 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

38
.obsidian/graph.json vendored
View file

@ -6,39 +6,17 @@
"hideUnresolved": true,
"showOrphans": false,
"collapse-color-groups": false,
"colorGroups": [
{
"query": "tag:#coding_problem",
"color": {
"a": 1,
"rgb": 6523645
}
},
{
"query": "tag:#CS_analysis",
"color": {
"a": 1,
"rgb": 14725458
}
},
{
"query": "tag:#TODO",
"color": {
"a": 1,
"rgb": 14701138
}
}
],
"colorGroups": [],
"collapse-display": false,
"showArrow": true,
"showArrow": false,
"textFadeMultiplier": 0,
"nodeSizeMultiplier": 1,
"lineSizeMultiplier": 1,
"collapse-forces": false,
"centerStrength": 0.5,
"repelStrength": 10.5952380952381,
"linkStrength": 0.505952380952381,
"linkDistance": 259,
"scale": 0.34081054256054544,
"close": false
"centerStrength": 0.518713248970312,
"repelStrength": 10,
"linkStrength": 1,
"linkDistance": 250,
"scale": 0.3914511147741139,
"close": true
}

2
OJ notes/pages/Leetcode Linked-List-Cycle.md
View file

@ -75,7 +75,7 @@ Return `true` _if there is a cycle in the linked list_. Otherwise, return `fals
> [!summary] > **Algorithm:**
> This is a #Floyd_s_cycle_finding_algorithm.
> This is pretty straightforward, visit for more info
> This is pretty straightforward, visit [[Floyd's Cycle Finding Algorithm]] for more info
### Solution