《数据结构与算法leetcodelintcode题解_共992页》pdf电子书免费下载
下载方式一：
百度网盘下载地址：https://pan.baidu.com/s/14waMQEQ6hCQbVL_JbyGz-A
百度网盘密码：1111
下载方式二：
http://ziliaoshare.cn/Download/af_124551_pd_SJJGYSFleetcodelintcodeTJ_G992Y.zip
|
|
作者：empty 页数：992 出版社：empty |
《数据结构与算法leetcodelintcode题解_共992页》介绍
·数据结构与算法-实验楼·本书的同步练习平台。·Leet Code Online Judge·找工作方面非常出名的一个0J， 每道题都有discuss页面，可以看别人分享的代码和讨论，很有参考价值，相应的题解非常多。不过在线代码编辑框不太好用， 写善写着框就拉干来子， 最近没有这个问题了， 评测速度通常比lint code快很多， 而且做完后可以看自己代码的运行时间分布，首推此OJ刷面试相关的匙。·Lint Code·和leet code类似的在线0J， 但是筛选和写代码时比较方便， 左边为题目， 右边为代码框。还可以在source处选择CC 150或者其他来源的题。会根据系统locale选择中文或者英文， 可以拿此0J辅助leet code进行练习。·hi ho Coder-非常不错的一个OJ， 每周都会推出一个专题供你学习， 都是干货。·Leet Code题解-Git Book-题解部分详细， 比较容易理解， 但题目很不全。·Free Tyme Kiya n/Leet Code-Sol-Res-Clean， Understandable Solutions andResources on Leet Code Online Judge Algorithms Problems..soul machine/leet code含C++和Java两个版本的题解。·Acm之家， 专业的ACM学习网站-各类题解·牛客网·国内一个IT求职方面的综合性网站，比较适合想在国内求职的看看。感谢某位美女的推荐：)其他资源·九章算法·代码质量大多不错，但是不太全。这家也同时提供有偿辅导。·刷题|一亩三分地论坛-时不时就会有惊喜放出。·VisuAl go-visualising datastructures and algorithms through animation·DataStructure Visualization-同上， 非常好的动画演示!!涵盖了常用的各种数据结·我的算法学习之路Lucida-Lucida(签约Google) 的算法学习经验分享。·Hired In Tech·System Design的总结特别适合入门.书籍推荐·挑战程序设计竞赛(第2版) (豆瓣) -ACM高手总结的各类基础算法和经典问题， 含金量非常高!算法进阶力荐1·Algorithm Design(豆瓣)·The Algorithm Design Manual， 作者还放出了自己上课的视频和slides-skien a'sAudio Lectures， The Algorithm Design Manual(豆瓣)·大部头有Introduction to Algorithm和TAO CP·Cracking The Coding Interview-著名的CTC I(又称CC 150) ， 除了算法数据结构等题以外， 还包含00 Design， Database， System Design， BrainTeaser等类型的题目。准备技术面试的同学一定要看
《数据结构与算法leetcodelintcode题解_共992页》目录
Basics Misc
Part II-Coding
String
Integer Array
Binary Search
Bit Manipulation
Implement strStr
Twa Strings Are Anagrams
Compare Strings
Group Anagrams
Longest Common Substring
Rotate String
Reverse Words in a String
Valid Palindrome
Longest Palindromic Substring
Space Replacement
Wildcard Matching
Length of Last Word
Count and Say
Remove Element
Zero Sum Subarray
SubarrayS umK
Subarray Sum Closest
Recover Rotated Sorted Array
Product of Array Exclude Itself
Partition Array
First Missing Postive
2Sum
3Sum
3Sum Closest
Remove Duplicates from Sorted Array
Remove Duplicates from Sorted Array II
Merge Sorted Array
Merge Sorted At ray II
Median
Partition Array by Odd and Even
Kth Largest Element
First Position of Target
Search Insert Position
Search for a Range
First Bad Version
Search a2D Matrix
Search a2DMatrixII
Find Peak Element
Search in Rotated Sorted At ray
Search in Rotated Sorted Array Il
Find Minimum in Rotated Sorted Array
Find Minimum in Rotated Sorted Array II
Median of two Sorted Arrays
Sqrt x
WoodCut
Single Number
Single Number II
Single Number III
O 1 Check Power of 2
Convert Integer A to Integer B
Factorial Trailing Zeroes
Unique Binary Search Trees
Update Bits
Fast Power
Hash Function
Happy Number
Count lin Binary
Fibonacci
A plus B Problem
Print Numbers by Recursion
Majority Number
Majority Number II
Majority Number III
Digit Counts
Ugly Number
Plus One
Remove Duplicates from Sorted List
Remove Duplicates from Sorted List II
Remove Duplicates from Unsorted List
Partition List
Add Two Numbers
Two Lis is Sum Advanced
Remove Nth Node From End of List
LinkedList Cycle
LinkedList Cycle II
Reverse LinkedList
Reverse LinkedList II
Merge Two Sorted Lists
Merge k Sorted Lists
Reorder List
Copy List with Random Pointer
Sort List
Insertion Sort List
Palindrome LinkedList
Delete Node in the Middle of Singly LinkedList
LRU Cache
Rotate List
Swap Nodes in Pairs
Remove LinkedList Elements
Binary Tree Preorder Traversal
Binary Tree In order Traversal
Binary Tree Post order Traversal
Binary Tree Level Order Traversal
Binary Tree Level Order Traversal II
Maximum Depth of Binary Tree
Balanced Binary Tree
Binary Tree Maximum Path Sum
Lowest Common Ancestor
Invert Binary Tree
Diameter of a Binary Tree
Binary Tree
Binary Search Tree
Exhaustive Search
Dynamic Programming
Construct Binary Tree from Preorder and In order Traversal
Construct Binary Tree from In order and Post order Traversal
Subtree
Binary Tree Zigzag Level Order Traversal
Binary Tree Serialization
Insert Node in a Binary Search Tree
Minimum Absolute Difference in BST
Vai date Binary Search Tree
Search Range in Binary Search Tree
Convert Sorted Array to Binary Search Tree
Convert Sorted List to Binary Search Tree
Binary Search Tree Iterator
Subsets
Unique Subsets
Permutations
Unique Permutations
Next Permutation
Previous Perm uation
Permutation Index
Perm nutation Index II
Permutation Sequence
Unique Binary Search Trees II
Palindrome Partitioning
Combinations
Combination Sum
Combination SumI
Minimum Depth of Binary Tree
WordSearch
Triangle
Backpack
Backpack II
Minimum Path Sum
Unique Paths
Unique Paths II
Climbing Stairs
Jump Game.
Word Break
Longest Increasing Subsequence
Palindrome Partitioning II
Jump Game II
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II
Best Time to Buy and Sell Stock HI I
Best Time to Buy and Sell Stock IV
Distinct Subsequences
Interleaving String
Maximum Subarray
Maximum Subarray II
Longest Increasing Continuous subsequence
Longest Increasing Continuous subsequence II
Egg Dropping Puzzle
Maximal Square
Graph
DataStructure
Problem Misc
Part III-Contest
Google APAC
Microsoft
Find the Connected Component in the Undirected Graph
Route Between Two Nodes in Graph
Topological So rng
Word Ladder
Bip arial Graph Part I
Implement Queue by Two Stacks
Min Stack
Sliding Window Maximum
Longest Words
Heap if y
Kth Smallest Number in Sorted Matrix
Nuts and Bolts