Algorithms
CtrlK
  • Introduction
  • Single Array 单数组
    • 找特殊元素
      • 【Medium】633. Find the Duplicate Number
  • Sub Arrays 子数组
    • 单个不限定长度
      • 【Easy】041. Maximum Subarray
      • 【Easy】044. Minimum Subarray
      • 【Easy】138. Subarray Sum
      • 【Medium】139. Subarray Sum Closest
      • 【Medium】191. Maximum Product Subarray
      • 【Medium】402. Continuous Subarray Sum
    • 单个限定长度
      • 【Medium】617. Maximum Average Subarray II
      • 【Medium】620. Maximum Subarray IV
      • 【Hard】621. Maximum Subarray V
    • 多个不相交
      • 【Medium】042. Maximum Subarray II
      • 【Medium】045. Maximum Subarray Difference
  • Two Arrays 双数组
    • 交集
      • 【Easy】548. Intersection of Two Arrays II
  • Linked List 链表
    • 排序
      • 【Easy】173. Insertion Sort List
    • 找特殊元素
      • 【Easy】174. Remove Nth Node From End of List
      • 【Easy】228. Middle of Linked List
      • 【Medium】960. First Unique Number in a Stream II
    • 原位更改
      • 【Easy】112. Remove Duplicates from Sorted List
      • 【Easy】451. Swap Nodes in Pairs
      • 【Easy】452. Remove Linked List Elements
      • 【Easy】822. Reverse Order Storage
    • 模拟操作
      • 【Easy】167. Add Two Numbers
      • 【Medium】221. Add Two Numbers II
      • 【Easy】466. Count Linked List Nodes
      • 【Medium】223. Palindrome Linked List
      • 【Medium】904. Plus One Linked List
  • Segment 线段
    • Segment Tree 基础
      • 【Medium】201. Segment Tree Build
      • 【Medium】202. Segment Tree Query
      • 【Medium】247. Segment Tree Query II
      • 【Medium】203. Segment Tree Modify
    • 区间求值
      • 【Medium】205. Interval Minimum Number
      • 【Medium】206. Interval Sum
      • 【Medium】751. Johns business
    • 数字比较
      • 【Medium】248. Count of Smaller Number
      • 【Hard】249. Count of Smaller Number before itself
  • Interval 区间
    • 区间排序
      • 【Easy】156. Merge Intervals
      • 【Medium】577. Merge K Sorted Interval Lists
      • 【Easy】839. Merge Two Sorted Interval Lists
      • 【Easy】920. Meeting Rooms
    • 区间交集
      • 【Easy】30. Insert Interval
      • 【Medium】 391. Number of Airplanes in the Sky
      • 【Medium】821. Time Intersection
      • 【Medium】919. Meeting Rooms II
    • 区间补充
      • 【Medium】641. Missing Interval
    • Sliding Window 滑动窗口
      • 【Hard】81. Data Stream Median
      • 【Hard】360. Sliding Window Median
  • Binary Search 二分法
    • 值域二分
      • 【Medium】617. Maximum Average Subarray II
      • 【Easy】662. Guess Number Game
    • 索引二分
      • 【Medium】460. Find K Closest Elements
      • 【Medium】824. Single Number IV
  • Sort 排序
    • 【Medium】104. Merge K Sorted Lists
  • Top-K 查询
    • 【Medium】401. Kth Smallest Number in Sorted Matrix
    • 【Medium】471. Top K Frequent Words
    • 【Medium】486. Merge K Sorted Arrays
    • 【Medium】518. Super Ugly Number
    • 【Medium】544. Top k Largest Numbers
    • 【Medium】545. Top k Largest Numbers II
    • 【Medium】606. Kth Largest Element II
    • 【Medium】612. K Closest Points
    • 【Medium】613. High Five
  • Palindrom 回文串
    • 验证
      • 【Easy】415. Valid Palindrome
      • 【Medium】891. Valid Palindrome II
      • 【Easy】916. Palindrome Permutation
    • 求最长
      • 【Medium】200. Longest Palindromic Substring
      • 【Easy】627. Longest Palindrome
  • Mathmatic 数学运算
    • 加法
      • 【Easy】001. A + B Problem
    • 开方
      • [【Easy】141. Sqrt(x)](【Easy】141. Sqrt(x).md)
      • [【Medium】586. Sqrt(x) II](【Medium】586. Sqrt(x) II.md)
    • 除法
      • 【Medium】414. Divide Two Integers
    • 次方
      • [【Medium】428. Pow(x, n)](【Medium】428. Pow(x, n).md)
  • Data Structure 构造数据结构
    • heap
      • 【Medium】 130. Heapify
Powered by GitBook
On this page
  1. Linked List 链表

原位更改

【Easy】112. Remove Duplicates from Sorted List【Easy】451. Swap Nodes in Pairs【Easy】452. Remove Linked List Elements【Easy】822. Reverse Order Storage
Previous【Medium】960. First Unique Number in a Stream IINext【Easy】112. Remove Duplicates from Sorted List

Last updated 7 years ago