leetcode
不会
Most
problem
set
in
interviews
are
testing
your
basic
knowledge.
DO
NOT
underestimate
the
importance
of
basics.
Problems
about
Array
To
begin
with,
a
simple
question:
283
To
minimize
space
complexity
to
O(1),
use
an
extra
index
k
as
pointer.
Exercise:
27,26,80
Some
classic
problems:
Quick
sort
with
3-way
partition:75
Exercise:
88(Merge
as
in
Merge
Sort),
215
Two
pointers:
Collider
pointer:
167,125,344,345,11
Sliding
window:
209,3,438,(76-hard）
对比：
对撞指针：
使用前提：数组，有序。
终止条件：while(l
<
r)
