老司机带你刷 LeetCode(1)，移动互联网开发技术就业前景

小蚂蚁

| 27 | [Remove Element]( ) | Array, Two Pointers |
| 28 | [Implement strStr()]( ) | Two Pointers, String |
| 35 | [Search Insert Position]( ) | String |
| 38 | [Count and Say]( ) | String |
| 53 | [Maximum Subarray]( ) | Array, Dynamic Programming, Divide and Conquer |
| 58 | [Length of Last Word]( ) | String |
| 66 | [Plus One]( ) | Array, Math |
| 67 | [Add Binary]( ) | Math, String |
| 69 | [Sqrt(x)]( ) | Binary Search, Math |
| 70 | [Climbing Stairs]( ) | Dynamic Programming |
| 83 | [Remove Duplicates from Sorted List]( ) | Linked List |
| 88 | [Merge Sorted Array]( ) | Array, Two Pointers |
| 100 | [Same Tree]( ) | Tree, Depth-first Search |
| 101 | [Symmetric Tree]( ) | Tree, Depth-first Search, Breadth-first Search |
| 104 | [Maximum Depth of Binary Tree]( ) | Tree, Depth-first Search |
| 107 | [Binary Tree Level Order Traversal II]( ) | Tree, Breadth-first Search |
| 108 | [Convert Sorted Array to Binary Search Tree]( ) | Tree, Depth-first Search |
| 110 | [Balanced Binary Tree]( ) | Tree, Depth-first Search |
| 111 | [Minimum Depth of Binary Tree]( ) | Tree, Depth-first Search, Breadth-first Search |
| 112 | [Path Sum]( ) | Tree, Depth-first Search |
| 118 | [Pascal's Triangle]( ) | Array |
| 119 | [Pascal's Triangle II]( ) | Array |
| 121 | [Best Time to Buy and Sell Stock]( ) | Array, Dynamic Programmin |
| 122 | [Best Time to Buy and Sell Stock II]( ) | Array, Greedy |
| 543 | [Diameter of Binary Tree]( ) | Tree |

Medium
#TitleTag2[Add Two Numbers]( )Linked List, Math3[Longest Substring Without Repeating Characters]( )Hash Table, Two Pointers, String5[Longest Palindromic Substring]( )String8[String to Integer (atoi)]( )Math, String15[3Sum]( )Array, Two Pointers17[Letter Combinations of a Phone Number]( )String, Backtracking19[Remove Nth Node From End of List]( )Linked List, Two Pointers33[Search in Rotated Sorted Array]( )Arrays, Binary Search43[Multiply Strings]( )Math, String49[Group Anagrams]( )Hash Table, String50[Pow(x, n)]( )Math, Binary Search56[Merge Intervals]( )Array, Sort554[Brick Wall]( )Hash Table
Hard
#TitleTag4[Median of Two Sorted Arrays]( )Array, Binary Search, Divide and Conquer10[Regular Expression Matching]( )String, Dynamic Programming, Backtracking23[Merge k Sorted Lists]( )Linked List, Divide and Conquer, Heap25[Reverse Nodes in k-Group]( )Linked List44[Reverse Nodes in k-Group]( )String, Dynamic Programming, Backtracking, Greedy57[Insert Interval]( )Array, Sort68[Text Justification]( )String最后
文末放一个小福利给大家，点击我的GitHub即可领取
群内有许多技术大牛，有任何问题，欢迎广大网友一起来交流，群内还不定期免费分享高阶Android学习视频资料和面试资料包~
偷偷说一句：群里高手如云，欢迎大家加群和大佬们一起交流讨论啊！