LintCode - Two Pointers 总结

同向双指针

Window Sum [easy]

Move Zeroes [easy]

Remove Duplicate Numbers In Array [easy]

 

相向双指针

Valid Palindrome

Rotate String

Recover Rotate Sorted Array

 

Two Sum

Two Sum

Two Sum II

Two Sum Data Structure Design (HashMap only)

Two Sum Input Array is Sorted

Two Sum Unique Pairs

3 Sum

Triangle Count

Two Sum Closest

3 Sum Closest

4 Sum

k Sum

Two Sum Difference Equals to target

 

Trapping Rain Water

Container with Most Water

 

Partition

Partition Array

 

Quick Select

Kth Smallest Numbers in Unsorted Array

Partition Array by Odd and Even

Interleaving Positive and Negative Numbers

Sort Letters by Case

Nuts Bolts Problems

分成两个部分 vs 分成三个部分

Sort Colors

Sort Letters by Case

Valid Palindrome

排序算法

Sort Colors II (RainBow Sort)

Pancake Sort

Sleep Sort

Spaghetti Sort

Bogo Sort

 

窗口类

Minimum Size Subarray Sum

Longest Substring Without Repeating Characters

Minimum Window Substring

Longest Substring with At Most Two Distinct Characters

Longest Substring with At Most K Distinct Characters

 

两个数组两个指针

The Smallest Difference

Merge Two Sorted Lists

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值