算法:题目汇总

链表,数组

  1. https://leetcode-cn.com/problems/reverse-linked-list/
  2. https://leetcode-cn.com/problems/linked-list-cycle
  3. https://leetcode-cn.com/problems/swap-nodes-in-pairs
  4. https://leetcode-cn.com/problems/linked-list-cycle-ii
  5. https://leetcode-cn.com/problems/reverse-nodes-in-k-group/

stack & queue

  1. https://leetcode-cn.com/problems/implement-queue-using-stacks/solution/
  2. https://leetcode-cn.com/problems/implement-stack-using-queues/description/

优先队列

hash table

  1. https://leetcode-cn.com/problems/lowest-common-ancestor-
    of-a-binary-tree/

递归,分治

  1. https://leetcode-cn.com/problems/powx-n/description/
  2. https://leetcode-cn.com/problems/majority-element/description/
  3. https://leetcode-cn.com/problems/maximum-subarray/description/
  4. https://leetcode-cn.com/problems/valid-anagram/#/description
  5. https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/#/description
  6. https://leetcode-cn.com/problems/anagrams/#/description

贪心

  1. https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/description/
  2. https://leetcode-cn.com/problems/lemonade-change/description/
  3. https://leetcode-cn.com/problems/assign-cookies/description/
  4. https://leetcode-cn.com/problems/walking-robot-simulation/description/

dfs, bfs

  1. https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
  2. https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/
  3. https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/description/
  4. https://leetcode-cn.com/problems/generate-parentheses/

剪枝

  1. https://leetcode-cn.com/problems/n-queens/
  2. https://leetcode-cn.com/problems/n-queens-ii/
  3. https://leetcode-cn.com/problems/valid-sudoku/description/
  4. https://leetcode-cn.com/problems/sudoku-solver/#/description

二分查找

  1. https://leetcode-cn.com/problems/sqrtx/
  2. https://leetcode-cn.com/problems/valid-perfect-square/

https://www.beyond3d.com/content/articles/8/ (扩展阅读)

字典树

  1. https://leetcode-cn.com/problems/implement-trie-prefix-tree/#/description
  2. https://leetcode-cn.com/problems/word-search-ii/

位运算

  1. https://leetcode-cn.com/problems/number-of-1-bits/
  2. https://leetcode-cn.com/problems/power-of-two/
  3. https://leetcode-cn.com/problems/counting-bits/description/
  4. https://leetcode-cn.com/problems/n-queens-ii/description/

动态规划

1.https://leetcode-cn.com/problems/climbing-stairs/description/
2.https://leetcode-cn.com/problems/triangle/description/
3.https://leetcode-cn.com/problems/maximum-product-subarray/description/
4.https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/#/description
5.https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/
6.https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/
7.https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/
8.https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
9.https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
10.https://leetcode-cn.com/problems/longest-increasing-subsequence
11.https://leetcode-cn.com/problems/coin-change/
12.https://leetcode-cn.com/problems/edit-distance/

并查集

  1. https://leetcode-cn.com/problems/number-of-islands/
  2. https://leetcode-cn.com/problems/friend-circles/

LRU

https://leetcode-cn.com/problems/lru-cache/#/

bloom 过滤

nothing

end

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值