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

vault backup: 2022-09-04 13:41:08

Browse source
This commit is contained in:
juan 2022-09-04 13:41:08 +08:00
parent 74387b9564
commit 543285d87b
2 changed files with 12 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
.obsidian/plugins/obsidian-style-settings/data.json vendored
View file

@ -8,5 +8,6 @@
"obsidian-prism-theme@@pt-hide-view-header": false, "obsidian-prism-theme@@pt-hide-view-header": false,
"obsidian-prism-theme@@accent-style-dt": "pt-accent-style-borderandfilled-dt", "obsidian-prism-theme@@accent-style-dt": "pt-accent-style-borderandfilled-dt",
"obsidian-prism-theme@@accent-style-lt": "pt-accent-style-borderandfilled-lt", "obsidian-prism-theme@@accent-style-lt": "pt-accent-style-borderandfilled-lt",
"obsidian-prism-theme@@background-type-lt": "pt-background-default-lt" "obsidian-prism-theme@@background-type-lt": "pt-background-default-lt",
"obsidian-prism-theme@@light-mark-highlight-style": "pt-highlight-style-filled-lt"
} }

13
OJ notes/pages/Leetcode Non-Overlapping-Intervals.md
View file

@ -4,7 +4,7 @@
> ##### Algorithms: > ##### Algorithms:
> >
> #algorithm > #algorithm #greedy
> >
> ##### Data structures: > ##### Data structures:
> >
@ -12,7 +12,7 @@
> >
> ##### Difficulty: > ##### Difficulty:
> >
> #coding_problem #difficulty- > #coding_problem #difficulty-medium
> >
> ##### Additional tags: > ##### Additional tags:
> >
@ -61,7 +61,14 @@ Given an array of intervals `intervals` where `intervals[i] = [starti, endi]`, r
### Thoughts ### Thoughts
> [!summary] > [!summary]
> This is a #template_remove_me > This is a #greedy problem, similar to [[Leetcode Merge-Intervals]]
#### Key concept:
first sort the intervals.
pick the intervals with smallest end, which will allow us to
make more room for following ones.
### Solution ### Solution