Solutions to LeetCode by Swift.
- A :
Array - DP :
Dynamic Programming - Str :
String - M :
Math - T :
Tree - HT :
Hash Table - DFS :
Depth-first Search - BFS :
Breadth-first Search - BS :
Binary Search - TP :
Two Pointers - B :
Backtracking - LL :
Linked List - D&C :
Divide and Conquer - H :
Heap - S :
Sort - G :
Greedy - BM :
Bit Manipulation - St :
Stack - Q :
Queue - D :
Design - GP :
Graph
The main.swift is to initialized Solution.func(val), then you can debug. Be sure when you initialize the Solution's swift file has chosen Target Membership, like the following image. And once time you just choose one Solution's swift file!
You can find all solution analysis in my blog LeetCode OJ, and the analysis to each problem is in the mext table blog.
