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

vault backup: 2022-09-05 16:10:30

Browse source
This commit is contained in:
juan 2022-09-05 16:10:30 +08:00
parent 57003c9601
commit e3bff4cb79
4 changed files with 25 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -1,6 +1,6 @@
{ {
"obsidian-prism-theme@@color-schemes-lt": "pt-color-scheme-periwinkle-lt", "obsidian-prism-theme@@color-schemes-lt": "pt-color-scheme-pistachio-lt",
"obsidian-prism-theme@@light-accent-color-preset": "pt-accent-color-purple-lt", "obsidian-prism-theme@@light-accent-color-preset": "pt-accent-color-green-lt",
"obsidian-prism-theme@@color-schemes-dt": "pt-color-scheme-indigo-dt", "obsidian-prism-theme@@color-schemes-dt": "pt-color-scheme-indigo-dt",
"obsidian-prism-theme@@pt-disable-blur": true, "obsidian-prism-theme@@pt-disable-blur": true,
"obsidian-prism-theme@@pt-disable-animations": true, "obsidian-prism-theme@@pt-disable-animations": true,

6
OJ notes/OJ-index.md
View file

@ -33,6 +33,12 @@ This is where I store notes about CS
#CS_list_need_practicing #CS_list_need_practicing
``` ```
#### Topics that needs care
- #sliding_window
- #Kadane_s_algorithm
- #greedy
## Websites ## Websites
#### [leetcode.com](https://leetcode.com) #### [leetcode.com](https://leetcode.com)

15
OJ notes/pages/Leetcode Subarray-Sum-Equals-K.md
View file

@ -4,11 +4,11 @@
> ##### Algorithms: > ##### Algorithms:
> >
> #algorithm #sliding_window #hash_table > #algorithm #hash_table
> >
> ##### Data structures: > ##### Data structures:
> >
> #DS > #DS #array
> >
> ##### Difficulty: > ##### Difficulty:
> >
@ -55,13 +55,16 @@ A subarray is a contiguous **non-empty** sequence of elements within an array.
### Thoughts ### Thoughts
> [!summary] > [!summary]
> This can be solved using #sliding_window > This can be solved using #prefix_sum and #hash_table
> I over-complicated the solution by adding stuff like > I over-complicated the solution by adding stuff like
> sorting, but it turn out to be not so difficult. > sorting, but it turn out to be not so difficult.
Since the subsets are **contiguous**, we can use sliding > [!tip]
window here. > Tried using sliding window, but it doesn't work because of
> negative numbers.
### Solution ### Solution
@ -100,4 +103,4 @@ public:
return count; return count;
} }
}; };
``` ```

9
OJ notes/pages/Two pointers approach.md
View file

@ -14,13 +14,14 @@
##### Difficulty: ##### Difficulty:
#CS_analysis #difficulty- #CS_analysis
##### Related problems: ##### Related problems:
##### Links: ##### Links:
- [leetcode](https://leetcode.com/explore/learn/card/fun-with-arrays/511/in-place-operations/) - [leetcode](https://leetcode.com/explore/learn/card/fun-with-arrays/511/in-place-operations/)
- [Two-pointers and sliding windows](https://leetcode.com/problems/subarray-sum-equals-k/discuss/301242/General-summary-of-what-kind-of-problem-can-cannot-solved-by-Two-Pointers)
--- ---
@ -35,3 +36,9 @@ By using two pointers, to in place modify array elements.
- There are two arrays, or linked lists - There are two arrays, or linked lists
- They are sorted, or operation in place will not interfere elements after. - They are sorted, or operation in place will not interfere elements after.
### When not use it?
Refer to [this link](https://leetcode.com/problems/subarray-sum-equals-k/discuss/301242/General-summary-of-what-kind-of-problem-can-cannot-solved-by-Two-Pointers)
#TODO: complete this section