leetCode通关必刷40题与面试真题算法题

算法通关40题,包含各类算法题,部分与剑指offer重叠

反转链表

https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof/

合并两个有序链表

https://leetcode-cn.com/problems/merge-two-sorted-lists/

汉诺塔问题

https://leetcode-cn.com/problems/hanota-lcci/

二叉树的最大深度

https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/

二叉树的最小深度

https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/

平衡二叉树

https://leetcode-cn.com/problems/ping-heng-er-cha-shu-lcof/

删除排序链表中的重复元素

https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/

最大二叉树

https://leetcode-cn.com/problems/maximum-binary-tree/

合并二叉树

https://leetcode-cn.com/problems/merge-two-binary-trees/

翻转二叉树

https://leetcode-cn.com/problems/invert-binary-tree/

对称二叉树

https://leetcode-cn.com/problems/symmetric-tree/

环形链表

https://leetcode-cn.com/problems/linked-list-cycle/

环形链表 II

https://leetcode-cn.com/problems/linked-list-cycle-ii/

有效的括号

https://leetcode-cn.com/problems/valid-parentheses/

用栈实现队列

https://leetcode-cn.com/problems/implement-queue-using-stacks/

用队列实现栈

https://leetcode-cn.com/problems/implement-stack-using-queues/

数据流中的第 K 大元素

https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/

滑动窗口最大值

https://leetcode-cn.com/problems/sliding-window-maximum/

有效的字母异位词

https://leetcode-cn.com/problems/valid-anagram/

两数之和

https://leetcode-cn.com/problems/two-sum/

三数之和

https://leetcode-cn.com/problems/3sum/

验证二叉搜索树

https://leetcode-cn.com/problems/validate-binary-search-tree/

二叉树的最近公共祖先

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

二叉搜索树的最近公共祖先

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

Pow(x, n)

https://leetcode-cn.com/problems/powx-n/

多数元素

https://leetcode-cn.com/problems/majority-element/

买卖股票的最佳时机

https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/

买卖股票的最佳时机 II

https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/

二叉树的层序遍历

https://leetcode-cn.com/problems/binary-tree-level-order-traversal/

括号生成

https://leetcode-cn.com/problems/generate-parentheses/

N 皇后

https://leetcode-cn.com/problems/n-queens/

有效的数独

https://leetcode-cn.com/problems/valid-sudoku/

x 的平方根

https://leetcode-cn.com/problems/sqrtx/

实现 Trie (前缀树)

https://leetcode-cn.com/problems/implement-trie-prefix-tree/

位1的个数

https://leetcode-cn.com/problems/number-of-1-bits/

2的幂

https://leetcode-cn.com/problems/power-of-two/

比特位计数

https://leetcode-cn.com/problems/counting-bits/

爬楼梯

https://leetcode-cn.com/problems/climbing-stairs/

三角形最小路径和

https://leetcode-cn.com/problems/triangle/

乘积最大子数组

https://leetcode-cn.com/problems/maximum-product-subarray/

最长递增子序列

https://leetcode-cn.com/problems/longest-increasing-subsequence/

零钱兑换

https://leetcode-cn.com/problems/coin-change/

编辑距离

https://leetcode-cn.com/problems/edit-distance/

岛屿数量

https://leetcode-cn.com/problems/number-of-islands/

LRU 缓存机制

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

 

面试真题

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值