算法题汇总

算法汇总

    1. 环形链表 https://leetcode.cn/problems/linked-list-cycle/
    1. 反转链表 https://leetcode.cn/problems/reverse-linked-list/28
    1. 环形链表 II https://leetcode.cn/problems/linked-list-cycle-ii/
    1. 快乐数 https://leetcode.cn/problems/happy-number/
    1. 反转链表 II https://leetcode.cn/problems/reverse-linked-list-ii/
    1. K 个一组翻转链表 https://leetcode.cn/problems/reverse-nodes-in-k-group/
  1. 1.两数之和 https://leetcode.cn/problems/two-sum/
    1. 搜索插入位置 https://leetcode.cn/problems/search-insert-position/
    1. 二分查找 https://leetcode.cn/problems/binary-search/
    1. 寻找旋转排序数组中的最小值 https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/
    1. 搜索旋转排序数组 https://leetcode.cn/problems/search-in-rotated-sorted-array/
    1. x 的平方根 https://leetcode.cn/problems/sqrtx/
    1. 在排序数组中查找元素的第一个和最后一个位置 https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/
    1. 在 D 天内送达包裹的能力 https://leetcode.cn/problems/capacity-to-ship-packages-within-d-days/
    1. 相同的树 https://leetcode.cn/problems/same-tree/
    1. 对称二叉树 https://leetcode.cn/problems/symmetric-tree/
    1. 合并二叉树 https://leetcode.cn/problems/merge-two-binary-trees/
    1. 二叉树的前序遍历 https://leetcode.cn/problems/binary-tree-preorder-traversal/
    1. 二叉树的最小深度 https://leetcode.cn/problems/minimum-depth-of-binary-tree/
    1. 二叉树展开为链表 https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/
    1. 二叉树的最近公共祖先 https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/
    1. 二叉树的直径 https://leetcode.cn/problems/diameter-of-binary-tree/
    1. 另一棵树的子树 https://leetcode.cn/problems/subtree-of-another-tree/
    1. 完全二叉树的节点个数 https://leetcode.cn/problems/count-complete-tree-nodes/
    1. 二叉树的所有路径 https://leetcode.cn/problems/binary-tree-paths/
    1. 二叉树的层序遍历 https://leetcode.cn/problems/binary-tree-level-order-traversal/
    1. 二叉树的层序遍历 II https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/
    1. 二叉树的右视图 https://leetcode.cn/problems/binary-tree-right-side-view/
    1. 二叉树的层平均值 https://leetcode.cn/problems/average-of-levels-in-binary-tree/
    1. 填充每个节点的下一个右侧节点指针 https://leetcode.cn/problems/populating-next-right-pointers-in-each-node/
    1. N 叉树的层序遍历 https://leetcode.cn/problems/n-ary-tree-level-order-traversal/
    1. 路径总和 https://leetcode.cn/problems/path-sum/
    1. 左叶子之和 https://leetcode.cn/problems/sum-of-left-leaves/
    1. 验证二叉搜索树 https://leetcode.cn/problems/validate-binary-search-tree/
    1. 恢复二叉搜索树 https://leetcode.cn/problems/recover-binary-search-tree/
    1. 用队列实现栈 https://leetcode.cn/problems/implement-stack-using-queues/
    1. 用栈实现队列 https://leetcode.cn/problems/implement-queue-using-stacks/
    1. 逆波兰表达式求值 https://leetcode.cn/problems/evaluate-reverse-polish-notation/
    1. 删除字符串中的所有相邻重复项 https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/
    1. 反转字符串中的单词 https://leetcode.cn/problems/reverse-words-in-a-string/description/
    1. 电话号码的字母组合 https://leetcode.cn/problems/letter-combinations-of-a-phone-number/
    1. 组合总和 https://leetcode.cn/problems/combination-sum/
    1. N 皇后 https://leetcode.cn/problems/n-queens/
    1. 解数独 https://leetcode.cn/problems/sudoku-solver/
    1. 组合 https://leetcode.cn/problems/combinations/
    1. 子集 https://leetcode.cn/problems/subsets/
    1. 分割回文串 https://leetcode.cn/problems/palindrome-partitioning/
    1. 复原 IP 地址 https://leetcode.cn/problems/restore-ip-addresses/
    1. 跳跃游戏 https://leetcode.cn/problems/jump-game/
    1. 跳跃游戏 II https://leetcode.cn/problems/jump-game-ii/
    1. 用最少数量的箭引爆气球 https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/
    1. 无重叠区间 https://leetcode.cn/problems/non-overlapping-intervals/
    1. Dota2 参议院 https://leetcode.cn/problems/dota2-senate/
    1. 爬楼梯 https://leetcode.cn/problems/climbing-stairs/
    1. 使用最小花费爬楼梯 https://leetcode.cn/problems/min-cost-climbing-stairs/
    1. 不同路径 https://leetcode.cn/problems/unique-paths/
    1. 不同路径 II https://leetcode.cn/problems/unique-paths-ii/
    1. 打家劫舍 https://leetcode.cn/problems/house-robber/
    1. 打家劫舍 II https://leetcode.cn/problems/house-robber-ii/
    1. 打家劫舍 III https://leetcode.cn/problems/house-robber-iii/
    1. 买卖股票的最佳时机 https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/
    1. 买卖股票的最佳时机 II https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/
    1. 买卖股票的最佳时机 III https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/
    1. 买卖股票的最佳时机含手续费 https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
    1. 最大子数组和 https://leetcode.cn/problems/maximum-subarray/
    1. 最长连续递增序列 https://leetcode.cn/problems/longest-continuous-increasing-subsequence/
    1. 零钱兑换 II https://leetcode.cn/problems/coin-change-ii/
    1. 判断子序列 https://leetcode.cn/problems/is-subsequence/
    1. 最长公共子序列 https://leetcode.cn/problems/longest-common-subsequence/
    1. 不同的子序列 https://leetcode.cn/problems/distinct-subsequences/
    1. 两个字符串的删除操作 https://leetcode.cn/problems/delete-operation-for-two-strings/
    1. 简化路径 https://leetcode.cn/problems/simplify-path/
    1. 赎金信 https://leetcode.cn/problems/ransom-note/
    1. 有效的字母异位词 https://leetcode.cn/problems/valid-anagram/
    1. 三数之和 https://leetcode.cn/problems/3sum/
    1. 四数之和 https://leetcode.cn/problems/4sum/
    1. Nim 游戏 https://leetcode.cn/problems/nim-game/
    1. 石子游戏 https://leetcode.cn/problems/stone-game/
    1. 3 的幂 https://leetcode.cn/problems/power-of-three/description/
    1. 数组中的第K个最大元素 https://leetcode.cn/problems/kth-largest-element-in-an-array/
    1. 数据流的中位数 https://leetcode.cn/problems/find-median-from-data-stream/
    1. 前 K 个高频元素 https://leetcode.cn/problems/top-k-frequent-elements/
    1. 最小栈 https://leetcode.cn/problems/min-stack/
    1. 整数反转 https://leetcode.cn/problems/reverse-integer/description/
  2. 61.旋转链表 https://leetcode.cn/problems/rotate-list/
  3. 24.两两交换链表的节点 https://leetcode.cn/problems/swap-nodes-in-pairs/
    1. 删除链表的倒数第 N 个结点 https://leetcode.cn/problems/remove-nth-node-from-end-of-list/
    1. 删除排序链表中的重复元素 https://leetcode.cn/problems/remove-duplicates-from-sorted-list/
    1. 删除排序链表中的重复元素 II https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/
    1. 设计循环队列 https://leetcode.cn/problems/design-circular-queue/
    1. 设计循环双端队列 https://leetcode.cn/problems/design-circular-deque/
    1. 设计前中后队列 https://leetcode.cn/problems/design-front-middle-back-queue/
    1. 最近的请求次数 https://leetcode.cn/problems/number-of-recent-calls
  4. 面试题 17.09. 第 k 个数 https://leetcode.cn/problems/get-kth-magic-number-lcci/
    1. 亲密字符串 https://leetcode.cn/problems/buddy-strings/
    1. 柠檬水找零 https://leetcode.cn/problems/lemonade-change
    1. 煎饼排序 https://leetcode.cn/problems/pancake-sorting/
    1. 任务调度器 https://leetcode.cn/problems/task-scheduler/
  5. 面试题 03.04. 化栈为队 https://leetcode.cn/problems/implement-queue-using-stacks-lcci/
    1. 棒球比赛 https://leetcode.cn/problems/baseball-game
    1. 比较含退格的字符串 https://leetcode.cn/problems/backspace-string-compare/
    1. 验证栈序列 https://leetcode.cn/problems/validate-stack-sequences/
    1. 有效的括号 https://leetcode.cn/problems/valid-parentheses
    1. 删除最外层的括号 https://leetcode.cn/problems/remove-outermost-parentheses
    1. 移除无效的括号 https://leetcode.cn/problems/minimum-remove-to-make-valid-parentheses
    1. 验证二叉树的前序序列化 https://leetcode.cn/problems/verify-preorder-serialization-of-a-binary-tree/
    1. 基本计算器 II https://leetcode.cn/problems/basic-calculator-ii/
  • 9
    点赞
  • 11
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值