OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
    • 双指针之先后指针
      • 283. Move Zeroes
      • 27. Remove Element
      • 26. Remove Duplicates from Sorted Array
      • 80. Remove Duplicates from Sorted Array II
      • 228. Summary Ranges
      • 369. Plus One Linked List
      • 443. String Compression
      • 925. Long Pressed Name
    • Sliding Window
    • 75. Sort Colors
    • 125. Valid Palindrome
    • Two Sum
    • Floyd Cycle
    • Permutation
    • Zigzag Iterator
    • 632. Smallest Range Covering Elements from K Lists
    • Strobogrammatic Number
    • Quick Select
    • 349. Intersection of Two Arrays
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
Powered by GitBook
On this page

Was this helpful?

  1. Multiple Pointers

双指针之先后指针

283. Move Zeroes27. Remove Element26. Remove Duplicates from Sorted Array80. Remove Duplicates from Sorted Array II228. Summary Ranges369. Plus One Linked List443. String Compression925. Long Pressed Name
PreviousMultiple PointersNext283. Move Zeroes

Last updated 6 years ago

Was this helpful?