copy from http://www.geeksforgeeks.org
印度人搞的很全的算法,数据结构,编程技巧集合网站,绝对秒杀中国所有编程站点
担心万一该站点关闭,那么这么多宝贵的资源就没了
所以收录下来,永久保存,便于脱机学习
==============================================
都是保存成mht文件,用PC浏览器直接可以打开阅读学习
最好使用opera浏览器打开,如果用谷歌浏览器打开,可能会遇到页面空白,但是等一下,就会出现题目和答案
因为保存文件都是用opera浏览器保存的
==============================================
如果这些题目和答案都看懂
那么微软,谷歌,亚马逊,IBM,INTEL,Oracle,Autodesk,阿里巴巴,腾讯,百度的笔试都是很轻松能通过的
http://pan.baidu.com/s/1slewhrB
程序员算法大全算法数据结构智力题
5星 · 超过95%的资源 需积分: 16 34 浏览量
2018-01-15
14:04:57
上传
评论 5
收藏 96.47MB ZIP 举报 
程序员算法大全算法数据结构智力题 （2137个子文件） 
Dial's Algorithm (Optimized Dijkstra for small range weights) - GeeksforGeeks.mht 1.35MB Puzzle _ Chemical Mystery - GeeksforGeeks.mht 1.02MB Puzzle 42 _ (Placing the numbers) - GeeksforGeeks.mht 896KB Find LCA in Binary Tree using RMQ - GeeksforGeeks.mht 757KB Treap (A Randomized Binary Search Tree) - GeeksforGeeks.mht 702KB Treap (A Randomized Binary Search Tree) - GeeksforGeeks.mht 702KB Analysis of Algorithms _ Set 3 (Asymptotic Notations) - GeeksforGeeks.mht 691KB Analysis of Algorithms _ Set 3 (Asymptotic Notations) - GeeksforGeeks.mht 691KB Fibonacci Coding - GeeksforGeeks.mht 677KB Sieve of Eratosthenes - GeeksforGeeks.mht 654KB Sieve of Eratosthenes - GeeksforGeeks.mht 653KB Fibonacci Search - GeeksforGeeks.mht 532KB Dynamic Programming _ Set 5 (Edit Distance) - GeeksforGeeks.mht 511KB Dynamic Programming _ Set 5 (Edit Distance) - GeeksforGeeks.mht 511KB Push Relabel Algorithm _ Set 1 (Introduction and Illustration) - GeeksforGeeks.mht 509KB Centroid Decomposition of Tree - GeeksforGeeks.mht 497KB K Dimensional Tree _ Set 3 (Delete) - GeeksforGeeks.mht 495KB K Dimensional Tree _ Set 3 (Delete) - GeeksforGeeks.mht 495KB Red-Black Tree _ Set 3 (Delete) - GeeksforGeeks.mht 476KB Red-Black Tree _ Set 3 (Delete) - GeeksforGeeks.mht 476KB Dynamic Programming _ Set 34 (Assembly Line Scheduling) - GeeksforGeeks.mht 466KB Branch and Bound _ Set 1 (Introduction with 0_1 Knapsack) - GeeksforGeeks.mht 465KB Sieve of Sundaram to print all primes smaller than n - GeeksforGeeks.mht 443KB Design an efficient data structure for given operations - GeeksforGeeks.mht 430KB Design an efficient data structure for given operations - GeeksforGeeks.mht 430KB Puzzle _ Yesterday Was Tomorrow - GeeksforGeeks.mht 424KB Missionaries and Cannibals - GeeksforGeeks.mht 415KB Find a Mother Vertex in a Graph - GeeksforGeeks.mht 411KB Top 10 Programming Languages of 2015 - GeeksforGeeks.mht 410KB Two Dimensional Binary Indexed Tree or Fenwick Tree - GeeksforGeeks.mht 408KB Binomial Heap - GeeksforGeeks.mht 399KB Binomial Heap - GeeksforGeeks.mht 399KB Puzzle 66 _ Walk to Office - GeeksforGeeks.mht 398KB Threaded Binary Tree - GeeksQuiz.mht 397KB Ukkonen's Suffix Tree Construction - Part 5 - GeeksforGeeks.mht 395KB Ukkonen's Suffix Tree Construction - Part 5 - GeeksforGeeks.mht 395KB Puzzle 1 _ (How to Measure 45 minutes using two identical wires_) - GeeksforGeeks.mht 388KB Diagonal Sum of a Binary Tree - GeeksforGeeks.mht 386KB Write a program to print all permutations of a given string - GeeksforGeeks.mht 375KB Write a program to print all permutations of a given string - GeeksforGeeks.mht 375KB Write a program to print all permutations of a given string - GeeksforGeeks.mht 375KB Dynamic Programming _ Set 30 (Dice Throw) - GeeksforGeeks.mht 374KB Count number of squares in a rectangle - GeeksforGeeks.mht 366KB Greedy Algorithms _ Set 2 (Kruskal’s Minimum Spanning Tree Algorithm) - GeeksforGeeks.mht 363KB Greedy Algorithms _ Set 2 (Kruskal’s Minimum Spanning Tree Algorithm) - GeeksforGeeks.mht 363KB Greedy Algorithms _ Set 2 (Kruskal’s Minimum Spanning Tree Algorithm) - GeeksforGeeks.mht 363KB Puzzle _ Strict Pill Schedule - GeeksforGeeks.mht 350KB Ukkonen's Suffix Tree Construction - Part 1 - GeeksforGeeks.mht 340KB Ukkonen's Suffix Tree Construction - Part 1 - GeeksforGeeks.mht 340KB Puzzle 44 _ Girl or Boy - GeeksforGeeks.mht 339KB Detect and Remove Loop in a Linked List - GeeksforGeeks.mht 335KB Detect and Remove Loop in a Linked List - GeeksforGeeks.mht 335KB Red-Black Tree _ Set 2 (Insert) - GeeksforGeeks.mht 334KB Red-Black Tree _ Set 2 (Insert) - GeeksforGeeks.mht 334KB Divide and Conquer _ Set 7 (The Skyline Problem) - GeeksforGeeks.mht 333KB Pascal's Triangle - GeeksforGeeks.mht 331KB Pascal's Triangle - GeeksforGeeks.mht 331KB Articulation Points (or Cut Vertices) in a Graph - GeeksforGeeks.mht 325KB Articulation Points (or Cut Vertices) in a Graph - GeeksforGeeks.mht 325KB K Dimensional Tree _ Set 1 (Search and Insert) - GeeksforGeeks.mht 325KB Applications of Minimum Spanning Tree Problem - GeeksforGeeks.mht 324KB Applications of Minimum Spanning Tree Problem - GeeksforGeeks.mht 324KB Pattern Searching _ Set 8 (Suffix Tree Introduction) - GeeksforGeeks.mht 321KB Pattern Searching _ Set 8 (Suffix Tree Introduction) - GeeksforGeeks.mht 321KB Equilateral Triangles using Matchsticks - GeeksforGeeks.mht 319KB Biconnected graph - GeeksforGeeks.mht 317KB Biconnected graph - GeeksforGeeks.mht 317KB Binary Indexed Tree or Fenwick Tree - GeeksforGeeks.mht 315KB B-Tree _ Set 3 (Delete) - GeeksforGeeks.mht 314KB B-Tree _ Set 3 (Delete) - GeeksforGeeks.mht 314KB K Dimensional Tree _ Set 1 (Search and Insert) - GeeksforGeeks.mht 312KB Transform a BST to greater sum tree - GeeksforGeeks.mht 310KB Transform a BST to greater sum tree - GeeksforGeeks.mht 310KB Data Structures and Algorithms _ Set 35 - GeeksforGeeks.mht 310KB Divide and Conquer _ Set 6 (Search in a Row-wise and Column-wise Sorted 2D Array) - GeeksforGeeks.mht 306KB Applications of Catalan Numbers - GeeksforGeeks.mht 302KB Longest Path in a Directed Acyclic Graph - GeeksforGeeks.mht 301KB Longest Path in a Directed Acyclic Graph - GeeksforGeeks.mht 301KB Dijsktra's algorithm.mht 293KB Dijsktra's algorithm.mht 292KB Dijsktra's algorithm.mht 292KB C Program for Red Black Tree Insertion - GeeksQuiz.mht 292KB Ukkonen's Suffix Tree Construction - Part 3 - GeeksforGeeks.mht 291KB Ukkonen's Suffix Tree Construction - Part 3 - GeeksforGeeks.mht 291KB Greedy Algorithms _ Set 5 (Prim’s Minimum Spanning Tree (MST)) - GeeksforGeeks.mht 288KB Greedy Algorithms _ Set 5 (Prim’s Minimum Spanning Tree (MST)) - GeeksforGeeks.mht 288KB Greedy Algorithms _ Set 5 (Prim’s Minimum Spanning Tree (MST)) - GeeksforGeeks.mht 288KB Greedy Algorithms _ Set 8 (Dijkstra’s Algorithm for Adjacency List Representation) - GeeksforGeeks.mht 287KB Greedy Algorithms _ Set 8 (Dijkstra’s Algorithm for Adjacency List Representation) - GeeksforGeeks.mht 287KB Greedy Algorithms _ Set 8 (Dijkstra’s Algorithm for Adjacency List Representation) - GeeksforGeeks.mht 287KB Greedy Algorithms _ Set 6 (Prim’s MST for Adjacency List Representation) - GeeksforGeeks.mht 287KB Greedy Algorithms _ Set 6 (Prim’s MST for Adjacency List Representation) - GeeksforGeeks.mht 287KB Greedy Algorithms _ Set 6 (Prim’s MST for Adjacency List Representation) - GeeksforGeeks.mht 287KB How to prepare for ACM - ICPC_ - GeeksforGeeks.mht 285KB Branch And Bound _ Set 4 (Job Assignment Problem) - GeeksforGeeks.mht 284KB How to check if an instance of 15 puzzle is solvable_ - GeeksforGeeks.mht 283KB Branch and Bound _ Set 3 (8 puzzle Problem) - GeeksforGeeks.mht 282KB Puzzle 9 _ (Find the fastest 3 horses) - GeeksforGeeks.mht 282KB proto van Emde Boas Trees _ Set 1 (Background and Introduction) - GeeksforGeeks.mht 281KB Check if a given number is sparse or not - GeeksforGeeks.mht 279KB共 2137 条
- 1
- 2
- 3
- 4
- 5
- 6
- 22
资源评论
天亮后说晚安2019-04-04不错，谢谢！！！！！！！！！！！！！！！！！！
小草不卑微2020-03-05挺好的，十分感谢
