思维导图备注

数据结构与算法/leetcode/lintcode题解

首页

小程序下载阅读记录

我的书签
添加书签移除书签

编辑文档

String

来源 1 浏览 1414 扫码分享 2018-03-09 21:09:07

String - 字符串

上一篇:

下一篇:

Appendix II System Design
- Scalability
- Statistics
- System Architecture
- The System Design Process
Appendix I Interview and Resume
- Interview
- Resume
Basics Algorithm
- Binary Search
- Bitmap
- Counting Problem
- Divide and Conquer
- Knapsack
- Math
  - Greatest Common Divisor
  - Prime
- Probability
  - Shuffle
Basics Data Structure
- Binary Tree
- Graph
- Heap
- Huffman Compression
- Linked List
- Map
- Queue
- Set
- Stack
- String
Basics Misc
- Bit Manipulation
Basics Sorting
- Bubble Sort
- Bucket Sort
- Counting Sort
- Heap Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Radix Sort
- Selection Sort
Binary Search
- Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array II
- Find Peak Element
- First Bad Version
- First Position of Target
- Median of two Sorted Arrays
- Search a 2D Matrix
- Search a 2D Matrix II
- Search for a Range
- Search Insert Position
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array II
- Sqrt x
- Wood Cut
Binary Search Tree
- Binary Search Tree Iterator
- Convert Sorted Array to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Insert Node in a Binary Search Tree
- Minimum Absolute Difference in BST
- Search Range in Binary Search Tree
- Validate Binary Search Tree
Binary Tree
- Balanced Binary Tree
- Binary Tree Inorder Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal II
- Binary Tree Maximum Path Sum
- Binary Tree Postorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Serialization
- Binary Tree Zigzag Level Order Traversal
- Construct Binary Tree from Inorder and Postorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- Diameter of a Binary Tree
- Invert Binary Tree
- Lowest Common Ancestor
- Maximum Depth of Binary Tree
- Subtree
Data Structure
- Heapify
- Implement Queue by Two Stacks
- Kth Smallest Number in Sorted Matrix
- Longest Words
- Min Stack
- Sliding Window Maximum
Dynamic Programming
- Backpack
- Backpack II
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock II
- Best Time to Buy and Sell Stock III
- Best Time to Buy and Sell Stock IV
- Climbing Stairs
- Distinct Subsequences
- Edit Distance
- Egg Dropping Puzzle
- Interleaving String
- Jump Game
- Jump Game II
- Longest Common Subsequence
- Longest Increasing Continuous subsequence
- Longest Increasing Continuous subsequence II
- Longest Increasing Subsequence
- Maximal Square
- Maximum Subarray
- Maximum Subarray II
- Minimum Path Sum
- Palindrome Partitioning II
- Triangle
- Unique Paths
- Unique Paths II
- Word Break
Exhaustive Search
- Combinations
- Combination Sum
- Combination Sum II
- Minimum Depth of Binary Tree
- Next Permutation
- Palindrome Partitioning
- Permutations
- Unique Permutations
- Permutation Index
- Permutation Index II
- Permutation Sequence
- Previous Permuation
- Subsets
- Unique Binary Search Trees II
- Unique Subsets
- Word Search
FAQ
- Guidelines for Contributing
Google APAC
- APAC 2015 Round B
  - Problem A. Password Attacker
- APAC 2016 Round D
  - Problem A. Dynamic Grid
Graph
- Bipartial Graph Part I
- Find the Connected Component in the Undirected Graph
- Route Between Two Nodes in Graph
- Topological Sorting
- Word Ladder
Integer Array
- 2 Sum
- 3 Sum
- 3 Sum Closest
- First Missing Positive
- Kth Largest Element
- Median
- Merge Sorted Array
- Merge Sorted Array II
- Partition Array
- Partition Array by Odd and Even
- Product of Array Exclude Itself
- Recover Rotated Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array II
- Remove Element
- Subarray Sum Closest
- Subarray Sum K
- Zero Sum Subarray
Linked List
- Add Two Numbers
- Copy List with Random Pointer
- Delete Node in the Middle of Singly Linked List
- Insertion Sort List
- Linked List Cycle
- Linked List Cycle II
- LRU Cache
- Merge k Sorted Lists
- Merge Two Sorted Lists
- Palindrome Linked List
- Partition List
- Remove Duplicates from Unsorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List II
- Remove Linked List Elements
- Remove Nth Node From End of List
- Reorder List
- Reverse Linked List
- Reverse Linked List II
- Rotate List
- Sort List
- Swap Nodes in Pairs
- Two Lists Sum Advanced
Math and Bit Manipulation
- A plus B Problem
- Count 1 in Binary
- Digit Counts
- Factorial Trailing Zeroes
- Fast Power
- Fibonacci
- Convert Integer A to Integer B
- Happy Number
- Hash Function
- Majority Number
- Majority Number II
- Majority Number III
- O1 Check Power of 2
- Plus One
- Print Numbers by Recursion
- Single Number
- Single Number II
- Single Number III
- Ugly Number
- Unique Binary Search Trees
- Update Bits
Microsoft
- Microsoft 2015 April
- Microsoft 2015 April 2
- Microsoft 2015 September 2
  - Problem A. Farthest Point
Part III - Contest
Part II - Coding
Part I - Basics
Problem Misc
- Add Binary
- Continuous Subarray Sum
- Continuous Subarray Sum II
- Find the Missing Number
- Gray Code
- Insert Interval
- Longest Consecutive Sequence
- Matrix Zigzag Traversal
- Merge Intervals
- Minimum Subarray
- Minimum Window Substring
- Nuts and Bolts Problem
- N Queens
- N Queens II
- Reverse Integer
- String to Integer
- Valid Sudoku
Preface
String
- Compare Strings
- Count and Say
- Group Anagrams
- Length of Last Word
- Longest Common Substring
- Longest Palindromic Substring
- Reverse Words in a String
- Rotate String
- Space Replacement
- Implement strStr
- Two Strings Are Anagrams
- Valid Palindrome
- Wildcard Matching
Tags

暂无相关搜索结果！

本文档使用 BookStack 构建

展开/收起文章目录

分享，让知识传承更久远

文章二维码

手机扫一扫，轻松掌上读

文档下载

请下载您需要的格式的文档，随时随地，享受汲取知识的乐趣！

PDF文档 EPUB文档 MOBI文档

微信小程序阅读

BookChat 微信小程序阅读

微信扫一扫，知识掌上学

书签列表

阅读记录

阅读进度: 0.00% ( 0/0 ) 重置阅读进度