JavaScript 算法练习

LeetCode 与 LintCode 解题记录。此为个人练习仓库，代码中对重要思想进行了注释，但是没有详细的解题思路。需解题思路请移步其它仓库，很抱歉。

每一道题都对应写有测试用例，但可能不够完整。如果您发现错误，欢迎给我留言，谢谢！

字符串

• 反转字符串中的单词

  • LeetCode 557. 反转字符串中的单词 III https://leetcode-cn.com/problems/reverse-words-in-a-string-iii/
  • LintCode 1173. 反转字符串 III https://www.lintcode.com/problem/reverse-words-in-a-string-iii/description

• 计数二进制子串

  • LeetCode 696. 计数二进制子串 https://leetcode-cn.com/problems/count-binary-substrings/
  • LintCode 1079. 连续子串计数 https://www.lintcode.com/problem/count-binary-substrings/description

• 重复的子串

  • LeetCode 459. 重复的子字符串 https://leetcode-cn.com/problems/repeated-substring-pattern/
  • LintCode 1227. 重复的子串模式 https://www.lintcode.com/problem/repeated-substring-pattern/description

• 正则表达式匹配

  • LeetCode 10. 正则表达式匹配 https://leetcode-cn.com/problems/regular-expression-matching/
  • LintCode 154. 正则表达式匹配 https://www.lintcode.com/problem/regular-expression-matching/description

• 恢复 IP 地址

  • LeetCode 93. 复原 IP 地址 https://leetcode-cn.com/problems/restore-ip-addresses/
  • LintCode 426. 恢复 IP 地址 https://www.lintcode.com/problem/restore-ip-addresses/description

• 存在重复元素

  • LeetCode 217. 存在重复元素 https://leetcode-cn.com/problems/contains-duplicate/

• 判断字符串是否没有重复字符

  • LintCode 157. 判断字符串是否没有重复字符 https://www.lintcode.com/problem/unique-characters/description

• 比较字符串

  • LintCode 55. 比较字符串 https://www.lintcode.com/problem/compare-strings/description

• 最长无重复字符的子串

  • LeetCode 3. 无重复字符的最长子串 https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/
  • LintCode 384. 最长无重复字符的子串 https://www.lintcode.com/problem/longest-substring-without-repeating-characters/description

• 最大数

  • LeetCode 179. 最大数 https://leetcode-cn.com/problems/largest-number/
  • LintCode 184. 最大数 https://www.lintcode.com/problem/largest-number/description

• 实现string2int()函数

  • 面试题参考思路，不严谨实现 廖雪峰 不要使用JavaScript内置的parseInt()函数，利用map和reduce操作实现一个string2int()函数。 https://www.liaoxuefeng.com/wiki/1022910821149312/1024322552460832

• 左旋转字符串

  • LeetCode 面试题58 - II. 左旋转字符串 https://leetcode-cn.com/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/

• 最后一个单词的长度

  • LeetCode 58. 最后一个单词的长度 https://leetcode-cn.com/problems/length-of-last-word/
  • LintCode 422. 最后一个单词的长度 https://www.lintcode.com/problem/length-of-last-word/description

• 整数转罗马数字

  • LeetCode 12. 整数转罗马数字 https://leetcode-cn.com/problems/integer-to-roman/
  • LintCode 418. 整数转罗马数字 https://www.lintcode.com/problem/integer-to-roman/description

• 罗马数字转整数

  • LeetCode 13. 罗马数字转整数 https://leetcode-cn.com/problems/roman-to-integer/
  • LintCode 419. 罗马数字转整数 https://www.lintcode.com/problem/roman-to-integer/description

• 验证回文字符串 Ⅱ

  • LeetCode 680. 验证回文字符串 Ⅱ https://leetcode-cn.com/problems/valid-palindrome-ii/
  • LintCode 891. 有效回文 II https://www.lintcode.com/problem/valid-palindrome-ii/description

• IP地址无效化

  • LeetCode 1108. IP 地址无效化 https://leetcode-cn.com/problems/defanging-an-ip-address/

• 最长回文子串

  • LeetCode 5. 最长回文子串 https://leetcode-cn.com/problems/longest-palindromic-substring/
  • LintCode 200. 最长回文子串 https://www.lintcode.com/problem/longest-palindromic-substring/

• 每个元音包含偶数次的最长子字符串

  • LeetCode 1371. 每个元音包含偶数次的最长子字符串 https://leetcode-cn.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/

• 最小覆盖子串

  • LeetCode 76. 最小覆盖子串 https://leetcode-cn.com/problems/minimum-window-substring/ -LintCode 1420. 最小覆盖子串II https://www.lintcode.com/problem/minimum-window-substring-ii/description

数组/队列/集合/映射

• 电话号码的字母组合

  • LeetCode 17. 电话号码的字母组合 https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/
  • LintCode 425. 电话号码的字母组合 https://www.lintcode.com/problem/letter-combinations-of-a-phone-number/description

• 卡牌分组

  • LeetCode 914. 卡牌分组 https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards/

• 删除排序数组中的重复项

  • LeetCode 26. 删除排序数组中的重复项 https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/
  • LintCode 100. 删除排序数组中的重复数字 https://www.lintcode.com/problem/remove-duplicates-from-sorted-array/description

• 能否种花

  • LeetCode 605. 种花问题 https://leetcode-cn.com/problems/can-place-flowers/
  • LintCode 1138. 能否放置花 https://www.lintcode.com/problem/can-place-flowers/description

• 循环升序数组

  • 假设有一个升序数组,经过不确定长度的偏移，得到一个新的数组，我们称为循环升序数组。 （例如：[0, 3, 4, 6, 7] 可能变成 [6, 7, 0, 3, 4]） 给定一个数字和一个循环升序数组，判断这个数字是否在这个数组内，在的话返回 true，否则返回 false。要求时间复杂度为 O(logN)

    示例 1： 输入：nums = [6, 7, 0, 3, 4]， target = 0 输出：true

    示例 2： 输入：nums = [6, 7, 0, 3, 4]， target = 5 输出：false

• 循环数组中的环-暂无解

  • LeetCode 457. 环形数组循环 https://leetcode-cn.com/problems/circular-array-loop/
  • LintCode 1229. 循环数组中的环 https://www.lintcode.com/problem/circular-array-loop/description

• 格雷编码

  • LeetCode 89. 格雷编码 https://leetcode-cn.com/problems/gray-code/
  • LintCode 411. 格雷编码 https://www.lintcode.com/problem/gray-code/description

• 数组划分

  • LintCode 31. 数组划分 https://www.lintcode.com/problem/partition-array/description

• 冒泡排序

• 选择排序

• 按奇偶排序数组

  • LeetCode 922. 按奇偶排序数组 II https://leetcode-cn.com/problems/sort-array-by-parity-ii/

• 数组中的第 K 个最大元素

  • LeetCode 215. 数组中的第 K 个最大元素 https://leetcode-cn.com/problems/kth-largest-element-in-an-array/
  • LeetCode 414. 第三大的数【相似，需去重】 https://leetcode-cn.com/problems/third-maximum-number/submissions/
  • LintCode 5. 第 k 大元素 https://www.lintcode.com/problem/kth-largest-element/description
  • LintCode 606. 第 K 大的元素 II https://www.lintcode.com/problem/kth-largest-element-ii/description
  • LintCode 544. 前 K 大数【相似】 https://www.lintcode.com/problem/top-k-largest-numbers/description
  • LintCode 479. 数组第二大数【相似】 https://www.lintcode.com/problem/second-max-of-array/description

• 最大间距

  • LeetCode 164. 最大间距 https://leetcode-cn.com/problems/maximum-gap/
  • LintCode 400. 最大间距 https://www.lintcode.com/problem/maximum-gap/

• 缺失的第一个正数

  • LeetCode 41. 缺失的第一个正数 https://leetcode-cn.com/problems/first-missing-positive/
  • LintCode 189. 丢失的第一个正整数 https://www.lintcode.com/problem/first-missing-positive/description
  • LintCode 681. 缺失的第一个素数【相似】 https://www.lintcode.com/problem/first-missing-prime-number/description

• 缺失的第一个素数

  • LintCode 681. 缺失的第一个素数 https://www.lintcode.com/problem/first-missing-prime-number/description

• 串联所有单词的子串

  • LeetCode 30. 串联所有单词的子串 https://leetcode-cn.com/problems/substring-with-concatenation-of-all-words/
  • LintCode 1362. 包含所有单词连接的子串 https://www.lintcode.com/problem/substring-with-concatenation-of-all-words/description

• 买卖股票的最佳时机 II

  • LeetCode 122. 买卖股票的最佳时机 II https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/
  • LintCode 150. 买卖股票的最佳时机 II https://www.lintcode.com/problem/best-time-to-buy-and-sell-stock-ii/description

• 搜索插入位置

  • LeetCode 35. 搜索插入位置 https://leetcode-cn.com/problems/search-insert-position/
  • LintCode 20. 搜索插入位置 https://www.lintcode.com/problem/search-insert-position/description

• 二分查找

  • LeetCode 35. 二分查找 https://leetcode-cn.com/problems/binary-search/
  • LintCode 20. 二分查找 https://www.lintcode.com/problem/first-position-of-target/description

• 查找常用字符

  • LeetCode 1002. 查找常用字符 https://leetcode-cn.com/problems/find-common-characters/

• 01 矩阵

  • LeetCode 542. 01 矩阵 https://leetcode-cn.com/problems/01-matrix/
  • LintCode 974. 01 矩阵 https://www.lintcode.com/problem/01-matrix/description

• 合并区间

  • LeetCode 56. 合并区间 https://leetcode-cn.com/problems/merge-intervals/
  • LintCode 156. 合并区间 https://www.lintcode.com/problem/merge-intervals/description

• 跳跃游戏

  • LeetCode 55. 跳跃游戏 https://leetcode-cn.com/problems/jump-game/
  • LintCode 116. 跳跃游戏 https://www.lintcode.com/problem/jump-game/description

• 盛最多水的容器

  • LeetCode 11. 盛最多水的容器 https://leetcode-cn.com/problems/container-with-most-water/
  • LintCode 383. 装最多水的容器 https://www.lintcode.com/problem/container-with-most-water/description

• 统计重复个数

  • LeetCode 466. 统计重复个数 https://leetcode-cn.com/problems/count-the-repetitions/
  • LintCode 1224. 统计重复个数 https://www.lintcode.com/problem/count-the-repetitions/description

• 岛屿的个数

  • LeetCode 200. 岛屿数量 https://leetcode-cn.com/problems/number-of-islands/
  • LintCode 433. 岛屿的个数 https://www.lintcode.com/problem/number-of-islands/description

• 统计「优美子数组」

  • LeetCode 1248. 统计「优美子数组」 https://leetcode-cn.com/problems/count-number-of-nice-subarrays/

• 主元素

  • LeetCode 面试题 17.10. 主要元素 https://leetcode-cn.com/problems/find-majority-element-lcci/
  • LintCode 46. 主元素 https://www.lintcode.com/problem/majority-element/description

• 逆序对

  • LeetCode 面试题51. 数组中的逆序对 https://leetcode-cn.com/problems/shu-zu-zhong-de-ni-xu-dui-lcof/
  • LintCode 532. 逆序对 https://www.lintcode.com/problem/reverse-pairs/description

• 搜索旋转排序数组

  • LeetCode 33. 搜索旋转排序数组 https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
  • LintCode 62. 搜索旋转排序数组 https://www.lintcode.com/problem/search-in-rotated-sorted-array/description

• 数组中数字出现的次数

  • LeetCode 面试题56 - I. 数组中数字出现的次数 https://leetcode-cn.com/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/

• 只出现一次的数字

  • LeetCode 136. 只出现一次的数字 https://leetcode-cn.com/problems/single-number/

• 山脉数组中查找目标值

  • LeetCode 1095. 山脉数组中查找目标值 https://leetcode-cn.com/problems/find-in-mountain-array/
  • LeetCode 852. 山脉数组的峰顶索引 https://leetcode-cn.com/problems/peak-index-in-a-mountain-array/
  • LintCode 585. 山脉序列中的最大值 https://www.lintcode.com/problem/maximum-number-in-mountain-sequence/description

• 快乐数

  • LeetCode 202. 快乐数 https://leetcode-cn.com/problems/happy-number/
  • LintCode 488. 快乐数 https://www.lintcode.com/problem/happy-number/description

• 最大子序和

  • LeetCode 53. 最大子序和 https://leetcode-cn.com/problems/maximum-subarray/
  • LeetCode 面试题42. 连续子数组的最大和 https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/
  • LintCode 41. 最大子数组 https://www.lintcode.com/problem/maximum-subarray/description

• 跳跃游戏II

  • LeetCode 45. 跳跃游戏 II https://leetcode-cn.com/problems/jump-game-ii/
  • LintCode 117. 跳跃游戏 II https://www.lintcode.com/problem/jump-game-ii/description

• 最大数和最小数

  • LintCode 770. 最大数和最小数 https://www.lintcode.com/problem/maximum-and-minimum/description

• 最低票价

  • LeetCode 983. 最低票价 https://leetcode-cn.com/problems/minimum-cost-for-tickets/

• 最大正方形

  • LeetCode 221. 最大正方形 https://leetcode-cn.com/problems/maximal-square/
  • LintCode 436. 最大正方形 https://www.lintcode.com/problem/maximal-square/description

• 数据流中第一个唯一的数字

  • LintCode 685. 数据流中第一个唯一的数字 https://www.lintcode.com/problem/first-unique-number-in-data-stream/description

• 第一个只出现一次的字符

  • LeetCode 面试题50. 第一个只出现一次的字符 https://leetcode-cn.com/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/
  • LeetCode 387. 字符串中的第一个唯一字符 https://leetcode-cn.com/problems/first-unique-character-in-a-string/
  • LintCode 209. 第一个只出现一次的字符 https://www.lintcode.com/problem/first-unique-character-in-a-string/description

• 乘积最大子数组

  • LeetCode 152. 乘积最大子数组 https://leetcode-cn.com/problems/maximum-product-subarray/
  • LintCode 191. 乘积最大子序列 https://www.lintcode.com/problem/maximum-product-subarray/description

• 最高频率的IP

  • LintCode 1613. 最高频率的IP https://www.lintcode.com/problem/highest-frequency-ip/description

栈

• 最大矩阵

  • LeetCode 85. 最大矩阵 https://leetcode-cn.com/problems/maximal-rectangle/
  • LintCode 510. 最大矩阵 https://www.lintcode.com/problem/maximal-rectangle/description

• 最小栈

  • LeetCode 155. 最小栈 https://leetcode-cn.com/problems/min-stack/
  • LintCode 12. 带最小值操作的栈 https://www.lintcode.com/problem/min-stack/description

数学

• 阶乘后的零

  • LeetCode 172. 阶乘后的零 https://leetcode-cn.com/problems/factorial-trailing-zeroes/submissions/
  • LintCode 2. 尾部的零 https://www.lintcode.com/problem/trailing-zeros/description

• 丑数 II

  • LeetCode 264. 丑数 II https://leetcode-cn.com/problems/ugly-number-ii/
  • LintCode 4. 丑数 II https://www.lintcode.com/problem/ugly-number-ii/description

• 面试题 08.11. 硬币

  • LeetCode 面试题 08.11. 硬币 https://leetcode-cn.com/problems/coin-lcci/

• 全排列

  • LeetCode 46. 全排列 https://leetcode-cn.com/problems/permutations/
  • LintCode 15. 全排列 https://www.lintcode.com/problem/permutations/description

• 最大数值

  • LeetCode 面试题 16.07. 最大数值 https://leetcode-cn.com/problems/maximum-lcci/

• 回文数

  • LeetCode 9. 回文数 https://leetcode-cn.com/problems/palindrome-number/
  • LintCode 491. 回文数 https://www.lintcode.com/problem/palindrome-number/description

• Pow(x, n)

  • LeetCode 50. Pow(x, n) https://leetcode-cn.com/problems/powx-n/
  • LintCode 428. x的n次幂 https://www.lintcode.com/problem/powx-n/description

• 和为K的子数组

  • LeetCode 560. 和为K的子数组 https://leetcode-cn.com/problems/subarray-sum-equals-k/
  • LintCode 838. 子数组和为K https://www.lintcode.com/problem/subarray-sum-equals-k/description

• 完美数

  • LeetCode 507. 完美数 https://leetcode-cn.com/problems/perfect-number/
  • LintCode 1199. 完美的数 https://www.lintcode.com/problem/perfect-number/description

堆

• 超级丑数【未完成】

  • LeetCode 313. 超级丑数 https://leetcode-cn.com/problems/super-ugly-number/
  • LintCode 518. 超级丑数 https://www.lintcode.com/problem/super-ugly-number/description

树

• 二叉树的右视图

  • LeetCode 199. 二叉树的右视图 https://leetcode-cn.com/problems/binary-tree-right-side-view/
  • LintCode 760. 二叉树的右视图 https://www.lintcode.com/problem/binary-tree-right-side-view/description

• 验证二叉搜索树

  • LeetCode 98. 验证二叉搜索树 https://leetcode-cn.com/problems/validate-binary-search-tree/
  • LintCode 95. 验证二叉查找树 https://www.lintcode.com/problem/validate-binary-search-tree/description

• 二叉树的最近公共祖先

  • LeetCode 236. 二叉树的最近公共祖先 https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/
  • LintCode 88. 最近公共祖先 https://www.lintcode.com/problem/lowest-common-ancestor-of-a-binary-tree/description

• 另一个树的子树

  • LeetCode 572. 另一个树的子树 https://leetcode-cn.com/problems/subtree-of-another-tree/
  • LintCode 1165. 另一个树的子树 https://www.lintcode.com/problem/subtree-of-another-tree/description

• 二叉树的层序遍历

  • LeetCode 102. 二叉树的层序遍历 https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
  • LintCode 69. 二叉树的层次遍历 https://www.lintcode.com/problem/binary-tree-level-order-traversal/description

• 二叉树的层次遍历 II

  • LeetCode 107. 二叉树的层次遍历 II https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/
  • LintCode 70. 二叉树的层次遍历 II https://www.lintcode.com/problem/binary-tree-level-order-traversal-ii/description

• 从前序与中序遍历序列构造二叉树

  • LeetCode 105. 从前序与中序遍历序列构造二叉树 https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
  • LintCode 73. 前序遍历和中序遍历树构造二叉树 https://www.lintcode.com/problem/construct-binary-tree-from-preorder-and-inorder-traversal/description

链表

• 合并K个排序链表

  • LeetCode 23. 合并K个排序链表 https://leetcode-cn.com/problems/merge-k-sorted-lists/
  • LintCode 104. 合并k个排序链表 https://www.lintcode.com/problem/merge-k-sorted-lists/description

• 合并两个有序链表

  • LeetCode 21. 合并两个有序链表 https://leetcode-cn.com/problems/merge-two-sorted-lists/
  • LeetCode 面试题25. 合并两个排序的链表 https://leetcode-cn.com/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof
  • LintCode 165. 合并两个排序链表 https://www.lintcode.com/problem/merge-two-sorted-lists/description

• 链表排序

  • LeetCode 148. 排序链表 https://leetcode-cn.com/problems/sort-list/
  • LintCode 98. 链表排序 https://www.lintcode.com/problem/sort-list/description

• 环形链表

  • LeetCode 141. 环形链表 https://leetcode-cn.com/problems/linked-list-cycle/
  • LintCode 102. 带环链表 https://www.lintcode.com/problem/linked-list-cycle/description

• 链表的中间结点

  • LeetCode 876. 链表的中间结点 https://leetcode-cn.com/problems/middle-of-the-linked-list/
  • LintCode 1609. 链表的中间结点 https://www.lintcode.com/problem/middle-of-the-linked-list/description

• K个一组翻转链表

  • LeetCode 25. K 个一组翻转链表 https://leetcode-cn.com/problems/reverse-nodes-in-k-group/
  • LintCode 450. K组翻转链表 https://www.lintcode.com/problem/reverse-nodes-in-k-group/description

图

• 课程表

  • LeetCode 210. 课程表 II https://leetcode-cn.com/problems/course-schedule-ii/
  • LeetCode 207. 课程表 https://leetcode-cn.com/problems/course-schedule/
  • LintCode 615. 课程表 https://www.lintcode.com/problem/course-schedule/description