{"id":13844341,"url":"https://github.com/0voice/campus_recruitmen_questions","last_synced_at":"2025-04-14T05:58:04.303Z","repository":{"id":37489004,"uuid":"380984345","full_name":"0voice/campus_recruitmen_questions","owner":"0voice","description":"2021年最新整理，5000道秋招/提前批/春招/常用面试题（含答案），包括leetcode，校招笔试题，面试题，算法题，语法题。","archived":false,"fork":false,"pushed_at":"2024-05-20T12:07:44.000Z","size":1254,"stargazers_count":2576,"open_issues_count":0,"forks_count":526,"subscribers_count":48,"default_branch":"main","last_synced_at":"2025-04-14T05:14:51.297Z","etag":null,"topics":["acm","cpp","leetcode","mysql","nginx","os","redis"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/0voice.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-06-28T09:58:27.000Z","updated_at":"2025-04-09T08:47:37.000Z","dependencies_parsed_at":"2024-08-04T17:38:54.915Z","dependency_job_id":null,"html_url":"https://github.com/0voice/campus_recruitmen_questions","commit_stats":{"total_commits":778,"total_committers":4,"mean_commits":194.5,"dds":"0.024421593830334154","last_synced_commit":"814ac61807c827792051be2f3a9dd930b5851fae"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/0voice%2Fcampus_recruitmen_questions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/0voice%2Fcampus_recruitmen_questions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/0voice%2Fcampus_recruitmen_questions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/0voice%2Fcampus_recruitmen_questions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/0voice","download_url":"https://codeload.github.com/0voice/campus_recruitmen_questions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248824693,"owners_count":21167345,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["acm","cpp","leetcode","mysql","nginx","os","redis"],"created_at":"2024-08-04T17:02:40.745Z","updated_at":"2025-04-14T05:58:04.260Z","avatar_url":"https://github.com/0voice.png","language":null,"funding_links":[],"categories":["Others"],"sub_categories":[],"readme":"# 2021年最新整理，5000道校招常用面试题，包含leetcode，校招笔试题，面试题，算法题，语法题。持续更新中。。。\n* :trophy: [ACM（已更新200道）](#1)\n* :triangular_flag_on_post: [剑指offer（已更新150道）](#2)\n* :medal_military: [leetcode（已更新200道）](#3)\n* :dart: [mysql（已更新100道）](#4)\n* :crystal_ball: [redis（已更新50道）](#5)\n* :airplane: [nginx（已更新32道）](#6)\n* :loudspeaker: [语法语言（已更新87道）](#7)\n* :hourglass: [网络原理（已更新36道）](#8)\n* :sparkles: [网络编程（已更新25道）](#9)\n* :desktop_computer: [操作系统（已更新18道）](#10)\n* :floppy_disk: [编译原理（已更新5道）](#11)\n* [并发](#14)\n* [堆与栈](#15)\n* [树](#16)\n* [图](#17)\n* [排序](#18)\n* [字符串](#19)\n* [联系专栏](#22)\n\n## 📢 重磅消息 —— 更多资源repo：\n\n* **[最全空降Golang资料补给包（满血战斗）](https://github.com/0voice/Introduction-to-Golang)**\n* **[Linux内核学习资料](https://github.com/0voice/linux_kernel_wiki)**\n* **[1000+份计算机paper](https://github.com/0voice/computer_expert_paper)**\n\n\n\u003ch3 id=\"1\"\u003e:trophy: ACM\u003c/h3\u003e \n\n---\n##### [1、zoj 3235 Prototype（原型）](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203235%20Prototype.md)\n##### [2、zoj 3770 Ranking System（先后次序排列方法）](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203770%20Ranking%20System.md)\n##### [3、zoj 2814 Surprising Strings（令人惊讶的字符串）](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202814%20Surprising%20Strings.md)\n##### [4、poj 2817 WordStack](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202817%20WordStack.md)\n##### [5、poj 3910 GCD Determinant](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203910%20GCD%20Determinant.md)\n##### [6、poj 2452 Sticks Problem](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202452%20Sticks%20Problem.md)\n##### [7、poj 3071 Football](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203071%20Football.md)\n##### [8、poj 1664 放苹果](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201664%20%E6%94%BE%E8%8B%B9%E6%9E%9C.md)\n##### [9、poj 3752 字母旋转游戏](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203752%20%E5%AD%97%E6%AF%8D%E6%97%8B%E8%BD%AC%E6%B8%B8%E6%88%8F.md)\n##### [10、poj 4006 Genghis Khan the Conqueror](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%204006%20Genghis%20Khan%20the%20Conqueror.md)\n##### [11、poj 1205 Water Treatment Plants](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201205%20Water%20Treatment%20Plants.md)\n##### [12、poj 3388 Japanese Puzzle](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203388%20Japanese%20Puzzle.md)\n##### [13、poj 2386 Lake Counting](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202386%20Lake%20Counting.md)\n##### [14、zoj 1861 Gas Station Numbers](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201861%20Gas%20Station%20Numbers.md)\n##### [15、zoj 3590 -3+1](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203590%20-3%2B1.md)\n##### [16、zoj 2837 Left Library Lift](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202837%20Left%20Library%20Lift.md)\n##### [17、zoj 1563 Pearls](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201563%20Pearls.md)\n##### [18、poj 1523 SPF](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201523%20SPF.md)\n##### [19、poj 1308 Is It A Tree?](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201308%20Is%20It%20A%20Tree%3F.md)\n##### [20、poj 2442 Sequence](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202442%20Sequence.md)\n##### [21、poj 2417 Discrete Logging](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202417%20Discrete%20Logging.md)\n##### [22、poj 3484 Showstopper](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203484%20Showstopper.md)\n##### [23、zoj 3109 Decode Message](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203109%20Decode%20Message.md)\n##### [24、poj 3548 Restoring the digits](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203548%20Restoring%20the%20digits.md)\n##### [25、zoj 2561 Order-Preserving Codes](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202561%20Order-Preserving%20Codes.md)\n##### [26、poj 2482 Stars in Your Window](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202482%20Stars%20in%20Your%20Window.md)\n##### [27、zoj 1507 Crazy Search](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201507%20Crazy%20Search.md)\n##### [28、poj 2447 RSA](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202447%20RSA.md)\n##### [29、poj 1628 Deduction](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201628%20Deduction.md)\n##### [30、zoj 3019 Puzzle](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203019%20Puzzle.md)\n##### [31、poj 1977 Odd Loving Bakers](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201977%20Odd%20Loving%20Bakers.md)\n##### [32、poj 1989 The Cow Lineup](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201989%20The%20Cow%20Lineup.md)\n##### [33、poj 2672 Hotkeys](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202672%20Hotkeys.md)\n##### [34、zoj 3393 Routing](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203393%20Routing.md)\n##### [35、zoj 3531 Alice Madness Return](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203531%20Alice%20Madness%20Return.md)\n##### [36、zoj 1418 Lazy Math Instructor](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201418%20Lazy%20Math%20Instructor.md)\n##### [37、poj 2918 Tudoku](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202918%20Tudoku.md)\n##### [38、zoj 2990 Decoding](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202990%20Decoding.md)\n##### [39、poj 2323 PERMS](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202323%20PERMS.md)\n##### [40、poj 1313 Booklet Printing](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201313%20Booklet%20Printing.md)\n##### [41、poj 3216 Repairing Company](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203216%20Repairing%20Company.md)\n##### [42、poj 1953 World Cup Noise](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201953%20World%20Cup%20Noise.md)\n##### [43、zoj 2247 Magic Trick](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202247%20Magic%20Trick.md)\n##### [44、zoj 3502 Contest](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203502%20Contest.md)\n##### [45、zoj 2011 Secret Code](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202011%20Secret%20Code.md)\n##### [46、zoj 1810 The Gourmet Club](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201810%20The%20Gourmet%20Club.md)\n##### [47、zoj 1898 Discrete Logging](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201898%20Discrete%20Logging.md)\n##### [48、zoj 3836 Circulation pipe](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203836%20Circulation%20pipe.md)\n##### [49、poj 3495 Bitwise XOR of Arithmetic Progression](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203495%20Bitwise%20XOR%20of%20Arithmetic%20Progression.md)\n##### [50、poj 3435 Sudoku Checker](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203435%20Sudoku%20Checker.md)\n##### [51、zoj 3114 Double Queue](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203114%20Double%20Queue.md)\n##### [52、poj 2506 Tiling](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202506%20Tiling.md)\n##### [53、zoj 2151 The Highest Profits](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202151%20The%20Highest%20Profits.md)\n##### [54、poj 1077 Eight](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201077%20Eight.md)\n##### [55、poj 1090 Chain](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201090%20Chain.md)\n##### [56、zoj 3890 Wumpus](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203890%20Wumpus.md)\n##### [57、poj 3532 Resistance](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203532%20Resistance.md)\n##### [58、zoj 1344 A Mazing Problem](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201344%20A%20Mazing%20Problem.md)\n##### [59、zoj 1259 Rails](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201259%20Rails.md)\n##### [60、poj 3183 Stump Removal](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203183%20Stump%20Removal.md)\n##### [61、poj 2893 M × N Puzzle](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202893%20M%20%C3%97%20N%20Puzzle.md)\n##### [62、zoj 1119 SPF](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201119%20SPF.md)\n##### [63、poj 3635 Full Tank?](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203635%20Full%20Tank%3F.md)\n##### [64、poj 3573 I18n](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203573%20I18n.md)\n##### [65、zoj 1179 Finding Rectangles](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201179%20Finding%20Rectangles.md)\n##### [66、poj 3449 Geometric Shapes](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203449%20Geometric%20Shapes.md)\n##### [67、poj 2749 Building roads](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202749%20Building%20roads.md)\n##### [68、zoj 2451 Minimizing maximizer](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202451%20Minimizing%20maximizer.md)\n##### [69、poj 3222 Edge Pairing](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203222%20Edge%20Pairing.md)\n##### [70、poj 1984 Navigation Nightmare](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201984%20Navigation%20Nightmare.md)\n##### [71、poj 3860 Fruit Weights](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203860%20Fruit%20Weights.md)\n##### [72、poj 2664 Prerequisites?](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202664%20Prerequisites%3F.md)\n##### [73、poj 3376 Finding Palindromes](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203376%20Finding%20Palindromes.md)\n##### [74、zoj 2725 Digital Deletions](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202725%20Digital%20Deletions.md)\n##### [75、zoj 1797 Least Common Multiple](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201797%20Least%20Common%20Multiple.md)\n##### [76、poj 3356 AGTC](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203356%20AGTC.md)\n##### [77、zoj 1743 Concert Hall Scheduling](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201743%20Concert%20Hall%20Scheduling.md)\n##### [78、zoj 1566 Too Lazy To Move](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201566%20Too%20Lazy%20To%20Move.md)\n##### [79、poj 3802 Cubist Artwork](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203802%20Cubist%20Artwork.md)\n##### [80、zoj 3347 Picture Handling](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203347%20Picture%20Handling.md)\n##### [81、zoj 1325 Palindromes](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201325%20Palindromes.md)\n##### [82、zoj 3634 Bounty hunter](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203634%20Bounty%20hunter.md)\n##### [83、zoj 1671 Walking Ant](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201671%20Walking%20Ant.md)\n##### [84、zoj 3661 Palindromic Substring](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203661%20Palindromic%20Substring.md)\n##### [85、poj 2362 Square](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202362%20Square.md)\n##### [86、zoj 2665 Heapsort](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202665%20Heapsort.md)\n##### [87、poj 3883 Penguin Bashing](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203883%20Penguin%20Bashing.md)\n##### [88、poj 3585 Accumulation Degree](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203585%20Accumulation%20Degree.md)\n##### [89、poj 1480 Optimal Programs](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201480%20Optimal%20Programs.md)\n##### [90、poj 2458 Rigging the Bovine Election](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202458%20Rigging%20the%20Bovine%20Election.md)\n##### [91、poj 3191 The Moronic Cowmpouter](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203191%20The%20Moronic%20Cowmpouter.md)\n##### [92、poj 2903 Joy of Mobile Routing](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202903%20Joy%20of%20Mobile%20Routing.md)\n##### [93、zoj 3898 Stean](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203898%20Stean.md)\n##### [94、poj 1972 Dice Stacking](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201972%20Dice%20Stacking.md)\n##### [95、poj 3363 Annoying painting tool](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203363%20Annoying%20painting%20tool.md)\n##### [96、zoj 3795 Grouping](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203795%20Grouping.md)\n##### [97、poj 2007 Scrambled Polygon](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202007%20Scrambled%20Polygon.md)\n##### [98、zoj 1535 Lucky Ticket](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201535%20Lucky%20Ticket.md)\n##### [99、zoj 1496 Best Fit](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201496%20Best%20Fit.md)\n##### [100、poj 1284 Primitive Roots](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201284%20Primitive%20Roots.md)\n##### [101、zoj 1966 Etaoin Shrdlu](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201966%20Etaoin%20Shrdlu.md)\n##### [102、poj 1051 P,MTHBGWB](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201051%20P%2CMTHBGWB.md)\n##### [103、poj 2201 Cartesian Tree](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202201%20Cartesian%20Tree.md)\n##### [104、poj 3715 Blue and Red](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203715%20Blue%20and%20Red.md)\n##### [105、poj 3361 Gaussian Prime Factors](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203361%20Gaussian%20Prime%20Factors.md)\n##### [106、poj 3901 The Computer Game](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203901%20The%20Computer%20Game.md)\n##### [107、poj 1127 Jack Straws](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201127%20Jack%20Straws.md)\n##### [108、zoj 3798 Abs Problem](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203798%20Abs%20Problem.md)\n##### [109、poj 3294 Life Forms](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203294%20Life%20Forms.md)\n##### [110、zoj 2594 Driving Straight](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202594%20Driving%20Straight.md)\n##### [111、poj 2206 poj 2206 Magic Multiplying Machine](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202206%20Magic%20Multiplying%20Machine.md)\n##### [112、poj 3623 Best Cow Line, Gold](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203623%20Best%20Cow%20Line%2C%20Gold.md)\n##### [113、zoj 2316 Matrix Multiplication](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202316%20Matrix%20Multiplication.md)\n##### [114、poj 2409 Let it Bead](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202409%20Let%20it%20Bead.md)\n##### [115、zoj 3212 K-Nice](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203212%20K-Nice.md)\n##### [116、poj 2668 Defending Castle](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202668%20Defending%20Castle.md)\n##### [117、poj 1909 Marbles on a tree](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201909%20Marbles%20on%20a%20tree.md)\n##### [118、zoj 1610 Count the Colors](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201610%20Count%20the%20Colors.md)\n##### [119、poj 1611 The Suspects](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201611%20The%20Suspects.md)\n##### [120、poj 3757 Simple Distributed storage system](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203757%20Simple%20Distributed%20storage%20system.md)\n##### [121、zoj 3690 Choosing number](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203690%20Choosing%20number.md)\n##### [122、poj 3196 Babylonian Roulette](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203196%20Babylonian%20Roulette.md)\n##### [123、zoj 3134 Travel](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203134%20Travel.md)\n##### [124、poj 2679 Adventurous Driving](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202679%20Adventurous%20Driving.md)\n##### [125、zoj 2898 Greedy Grave Robber](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202898%20Greedy%20Grave%20Robber.md)\n##### [126、poj 3554 Almost the shortest route](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203554%20Almost%20the%20shortest%20route.md)\n##### [127、zoj 2361 Areas](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202361%20Areas.md)\n##### [128、poj 1534 Terrorist Attack](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201534%20Terrorist%20Attack.md)\n##### [129、poj 2622 Convex hull](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202622%20Convex%20hull.md)\n##### [130、poj 3632 Optimal Parking](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203632%20Optimal%20Parking.md)\n##### [131、poj 4003 Bob’s Race](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%204003%20Bob%E2%80%99s%20Race.md)\n##### [132、poj 1619 EKG Sequence](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201619%20EKG%20Sequence.md)\n##### [133、poj 3914 DuLL](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203914%20DuLL.md)\n##### [134、poj 3987 Computer Virus on Planet Pandora](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203987%20Computer%20Virus%20on%20Planet%20Pandora.md)\n##### [135、zoj 2993 Model Rocket Height](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202993%20Model%20Rocket%20Height.md)\n##### [136、zoj 3151 Dice Compare](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203151%20Dice%20Compare.md)\n##### [137、zoj 1279 Cowculations](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201279%20Cowculations.md)\n##### [138、poj 1353 Color Change of Go Game Pieces](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201353%20Color%20Change%20of%20Go%20Game%20Pieces.md)\n##### [139、poj 3782 Equal Sum Partitions](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203782%20Equal%20Sum%20Partitions.md)\n##### [140、poj 3481 Double Queue](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203481%20Double%20Queue.md)\n##### [141、poj 1153 SAFE](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201153%20SAFE.md)\n##### [142、zoj 2499 The Happy Worm](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202499%20The%20Happy%20Worm.md)\n##### [143、poj 3763 Tour in Wonder Land](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203763%20Tour%20in%20Wonder%20Land.md)\n##### [144、zoj 3385 Hanami Party](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203385%20Hanami%20Party.md)\n##### [145、zoj 3051 Playing Poker](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203051%20Playing%20Poker.md)\n##### [146、zoj 2009 Run Away](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202009%20Run%20Away.md)\n##### [147、poj 1559 Equation Elation](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201559%20Equation%20Elation.md)\n##### [148、poj 3579 Median](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203579%20Median.md)\n##### [149、poj 2430 Lazy Cows](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202430%20Lazy%20Cows.md)\n##### [150、zoj 1255 The Path](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201255%20The%20Path.md)\n##### [151、zoj 3595 Two Sequences](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203595%20Two%20Sequences.md)\n##### [152、zoj 3016 Cut](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203016%20Cut.md)\n##### [153、poj 3174 Alignment of the Planets](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203174%20Alignment%20of%20the%20Planets.md)\n##### [154、zoj 3813 Alternating Sum](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203813%20Alternating%20Sum.md)\n##### [155、poj 1690 (Your)((Term)((Project)))](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201690%20Your-Term-Project.md)\n##### [156、poj 1650 Integer Approximation](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201650%20Integer%20Approximation.md)\n##### [157、zoj 1472 Overlapping Shapes](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201472%20Overlapping%20Shapes.md)\n##### [158、zoj 1812 Stamps](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201812%20Stamps.md)\n##### [159、poj 2403 Hay Points](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202403%20Hay%20Points.md)\n##### [160、zoj 1400 Programmer, Rank Thyself](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201400%20Programmer%2C%20Rank%20Thyself.md)\n##### [161、poj 2941 Homogeneous Squares](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202941%20Homogeneous%20Squares.md)\n##### [162、poj 1149 PIGS](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201149%20PIGS.md)\n##### [163、poj 1240 Pre-Post-erous!](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201240%20Pre-Post-erous!.md)\n##### [164、poj 3349 Snowflake Snow Snowflakes](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203349%20Snowflake%20Snow%20Snowflakes.md)\n##### [165、poj 1459 Power Network](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201459%20Power%20Network.md)\n##### [166、poj 2978 Colored stones](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202978%20Colored%20stones.md)\n##### [167、poj 3219 Binomial Coefficients](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203219%20Binomial%20Coefficients.md)\n##### [168、zoj 2191 Series Determination](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202191%20Series%20Determination.md)\n##### [169、zoj 2913 Bus Pass](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202913%20Bus%20Pass.md)\n##### [170、poj 3260 The Fewest Coins](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203260%20The%20Fewest%20Coins.md)\n##### [171、poj 3593 Sea Base Exploration](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203593%20Sea%20Base%20Exploration.md)\n##### [172、poj 3131 Cubic Eight-Puzzle](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203131%20Cubic%20Eight-Puzzle.md)\n##### [173、zoj 2634 Collecting Stones](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202634%20Collecting%20Stones.md)\n##### [174、poj 1417 True Liars](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201417%20True%20Liars.md)\n##### [175、poj 1789 Truck History](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201789%20Truck%20History.md)\n##### [176、zoj 2139 ACM](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202139%20ACM.md)\n##### [177、poj 3050 Hopscotch](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203050%20Hopscotch.md)\n##### [178、zoj 3663 Polaris of Pandora](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203663%20Polaris%20of%20Pandora.md)\n##### [179、poj 1780 Code](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201780%20Code.md)\n##### [180、poj 3266 Cow School](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203266%20Cow%20School.md)\n##### [181、poj 2771 Guardian of Decency](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202771%20Guardian%20of%20Decency.md)\n##### [182、zoj 1501 Knockout Tournament](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201501%20Knockout%20Tournament.md)\n##### [183、poj 2827 Auto-Calculation Machine](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202827%20Auto-Calculation%20Machine.md)\n##### [184、poj 3612 Telephone Wire](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%203612%20Telephone%20Wire.md)\n##### [185、zoj 1237 Fans and Gems](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201237%20Fans%20and%20Gems.md)\n##### [186、zoj 2671 Cryptography](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202671%20Cryptography.md)\n##### [187、zoj 1433 Treasure Hunters](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201433%20Treasure%20Hunters.md)\n##### [188、poj 2174 Decoding Task](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202174%20Decoding%20Task.md)\n##### [189、zoj 3291 Never End](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203291%20Never%20End.md)\n##### [190、zoj 3049 Diablo II Items](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203049%20Diablo%20II%20Items.md)\n##### [191、zoj 1204 Additive equations](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201204%20Additive%20equations.md)\n##### [192、zoj 2886 Look and Say](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%202886%20Look%20and%20Say.md)\n##### [193、poj 2196 Specialized Four-Digit Numbers](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202196%20Specialized%20Four-Digit%20Numbers.md)\n##### [194、poj 2900 Griddy Hobby](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%202900%20Griddy%20Hobby.md)\n##### [195、poj 1663 Number Steps](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201663%20Number%20Steps.md)\n##### [196、zoj 1497 Ball Toss](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201497%20Ball%20Toss.md)\n##### [197、zoj 1404 Oil Pipeline](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%201404%20Oil%20Pipeline.md)\n##### [198、zoj 3805 Machine](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203805%20Machine.md)\n##### [199、zoj 3811 Untrusted Patrol](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/zoj%203811%20Untrusted%20Patrol.md)\n##### [200、poj 1184 聪明的打字员](https://github.com/0voice/campus_recruitmen_questions/blob/main/ACM/poj%201184%20%E8%81%AA%E6%98%8E%E7%9A%84%E6%89%93%E5%AD%97%E5%91%98.md)\n\n\u003cbr\u003e\n\n\u003ch3 id=\"2\"\u003e:triangular_flag_on_post: 剑指offer\u003c/h3\u003e \n\n---\n##### [1、A + B](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/A%20%2B%20B.md)                          \n##### [2、01背包问题](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98.md)                     \n##### [3、完全背包问题](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98.md)\n##### [4、多重背包问题 I](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%20I.md)\n##### [5、多重背包问题 II](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%20II.md)\n##### [6、多重背包问题 III](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%20III.md)\n##### [7、混合背包问题](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%B7%B7%E5%90%88%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98.md)\n##### [8、二维费用的背包问题](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E7%BB%B4%E8%B4%B9%E7%94%A8%E7%9A%84%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98.md)\n##### [9、分组背包问题](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%88%86%E7%BB%84%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98.md)\n##### [10、有依赖的背包问题](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%89%E4%BE%9D%E8%B5%96%E7%9A%84%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98.md)\n##### [11、背包问题求方案数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E6%B1%82%E6%96%B9%E6%A1%88%E6%95%B0.md)\n##### [12、背包问题求具体方案](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E6%B1%82%E5%85%B7%E4%BD%93%E6%96%B9%E6%A1%88.md)\n##### [13、找出数组中重复的数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%89%BE%E5%87%BA%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md)\n##### [14、不修改数组找出重复的数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%B8%8D%E4%BF%AE%E6%94%B9%E6%95%B0%E7%BB%84%E6%89%BE%E5%87%BA%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md)\n##### [15、二维数组中的查找](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE.md)\n##### [16、替换空格](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC.md)\n##### [17、从尾到头打印链表](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8.md)\n##### [18、重建二叉树](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n##### [19、二叉树的下一个节点](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E8%8A%82%E7%82%B9.md)\n##### [20、用两个栈实现队列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md)\n##### [21、斐波那契数列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97.md)\n##### [22、旋转数组的最小数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.md)\n##### [23、矩阵中的路径](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84.md)\n##### [24、机器人的运动范围](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4.md)\n##### [25、剪绳子](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%89%AA%E7%BB%B3%E5%AD%90.md)\n##### [26、二进制中1的个数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0.md)               \n##### [27、数值的整数次方](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9.md)\n##### [28、在O(1)时间删除链表结点](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%9C%A8O(1)%E6%97%B6%E9%97%B4%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%BB%93%E7%82%B9.md)\n##### [29、删除链表中重复的节点](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E8%8A%82%E7%82%B9.md)\n##### [30、正则表达式匹配](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md)\n##### [31、表示数值的字符串](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%80%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md)\n##### [32、调整数组顺序使奇数位于偶数前面](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2.md)\n##### [33、链表中倒数第k个节点](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9.md)\n##### [34、链表中环的入口结点](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E7%BB%93%E7%82%B9.md)\n##### [35、反转链表](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md)\n##### [36、合并两个排序的链表](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8.md)\n##### [37、树的子结构](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84.md)\n##### [38、二叉树的镜像](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F.md)\n##### [39、对称的二叉树](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n##### [40、顺时针打印矩阵](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5.md)\n##### [41、包含min函数的栈](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88.md)\n##### [42、栈的压入、弹出序列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E3%80%81%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97.md)\n##### [43、不分行从上往下打印二叉树](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%B8%8D%E5%88%86%E8%A1%8C%E4%BB%8E%E4%B8%8A%E5%BE%80%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n##### [44、分行从上往下打印二叉树](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%88%86%E8%A1%8C%E4%BB%8E%E4%B8%8A%E5%BE%80%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n##### [45、之字形打印二叉树](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%B9%8B%E5%AD%97%E5%BD%A2%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n##### [46、二叉搜索树的后序遍历序列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97.md)\n##### [47、二叉树中和为某一值的路径](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%92%8C%E4%B8%BA%E6%9F%90%E4%B8%80%E5%80%BC%E7%9A%84%E8%B7%AF%E5%BE%84.md)\n##### [48、复杂链表的复刻](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%BB.md)\n##### [49、二叉搜索树与双向链表](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%8E%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md)\n##### [50、序列化二叉树](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n##### [51、数字排列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E5%AD%97%E6%8E%92%E5%88%97.md)\n##### [52、数组中出现次数超过一半的数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%87%E4%B8%80%E5%8D%8A%E7%9A%84%E6%95%B0%E5%AD%97.md)\n##### [53、最小的k个数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0.md)\n##### [54、数据流中的中位数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md)\n##### [55、连续子数组的最大和](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md)\n##### [56、从1到n整数中1出现的次数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BB%8E1%E5%88%B0n%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md)\n##### [57、数字序列中某一位的数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E5%AD%97%E5%BA%8F%E5%88%97%E4%B8%AD%E6%9F%90%E4%B8%80%E4%BD%8D%E7%9A%84%E6%95%B0%E5%AD%97.md)\n##### [58、把数组排成最小的数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md)\n##### [59、把数字翻译成字符串](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%8A%8A%E6%95%B0%E5%AD%97%E7%BF%BB%E8%AF%91%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md)\n##### [60、礼物的最大价值](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC.md)\n##### [61、最长不含重复字符的子字符串](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%80%E9%95%BF%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md)\n##### [62、丑数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%B8%91%E6%95%B0.md)\n##### [63、字符串中第一个只出现一次的字符](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6.md)\n##### [64、字符流中第一个只出现一次的字符](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%AD%97%E7%AC%A6%E6%B5%81%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6(1).md)\n##### [65、数组中的逆序对](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9.md)\n##### [66、两个链表的第一个公共结点](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%85%AC%E5%85%B1%E7%BB%93%E7%82%B9.md)\n##### [67、数字在排序数组中出现的次数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E5%AD%97%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md)\n##### [68、0到n-1中缺失的数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/0%E5%88%B0n-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md)\n##### [69、数组中数值和下标相等的元素](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%80%BC%E5%92%8C%E4%B8%8B%E6%A0%87%E7%9B%B8%E7%AD%89%E7%9A%84%E5%85%83%E7%B4%A0.md)\n##### [70、二叉搜索树的第k个结点](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E4%B8%AA%E7%BB%93%E7%82%B9.md)\n##### [71、二叉树的深度](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6.md)\n##### [72、判断该树是不是平衡二叉树](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%88%A4%E6%96%AD%E8%AF%A5%E6%A0%91%E6%98%AF%E4%B8%8D%E6%98%AF%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n##### [73、数组中只出现一次的两个数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E7%BB%84%E4%B8%AD%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97.md)\n##### [74、数组中唯一只出现一次的数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E7%BB%84%E4%B8%AD%E5%94%AF%E4%B8%80%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md)\n##### [75、和为S的两个数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%92%8C%E4%B8%BAS%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97.md)\n##### [76、和为S的连续正数序列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%92%8C%E4%B8%BAS%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%AD%A3%E6%95%B0%E5%BA%8F%E5%88%97.md)\n##### [77、翻转单词顺序](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F.md)\n##### [78、左旋转字符串](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md)\n##### [79、滑动窗口的最大值](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md)\n##### [80、骰子的点数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%AA%B0%E5%AD%90%E7%9A%84%E7%82%B9%E6%95%B0.md)\n##### [81、扑克牌的顺子](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%89%91%E5%85%8B%E7%89%8C%E7%9A%84%E9%A1%BA%E5%AD%90.md)\n##### [82、圆圈中最后剩下的数字](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0%E5%AD%97.md)\n##### [83、股票的最大利润](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6.md)\n##### [84、求1+2+…+n](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%B1%821%2B2%2B%E2%80%A6%2Bn.md)\n##### [85、不用加减乘除做加法](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%B8%8D%E7%94%A8%E5%8A%A0%E5%87%8F%E4%B9%98%E9%99%A4%E5%81%9A%E5%8A%A0%E6%B3%95.md)\n##### [86、构建乘积数组](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84.md)\n##### [87、把字符串转换成整数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%88%90%E6%95%B4%E6%95%B0.md)\n##### [88、树中两个结点的最低公共祖先](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%A0%91%E4%B8%AD%E4%B8%A4%E4%B8%AA%E7%BB%93%E7%82%B9%E7%9A%84%E6%9C%80%E4%BD%8E%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md)\n##### [89、a^b](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/a%5Eb.md)\n##### [90、64位整数乘法](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/64%E4%BD%8D%E6%95%B4%E6%95%B0%E4%B9%98%E6%B3%95.md)\n##### [91、最短Hamilton路径](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%80%E7%9F%ADHamilton%E8%B7%AF%E5%BE%84.md)\n##### [92、递归实现指数型枚举](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%80%92%E5%BD%92%E5%AE%9E%E7%8E%B0%E6%8C%87%E6%95%B0%E5%9E%8B%E6%9E%9A%E4%B8%BE%20.md)\n##### [93、递归实现组合型枚举](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%80%92%E5%BD%92%E5%AE%9E%E7%8E%B0%E7%BB%84%E5%90%88%E5%9E%8B%E6%9E%9A%E4%B8%BE.md)\n##### [94、递归实现排列型枚举](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%80%92%E5%BD%92%E5%AE%9E%E7%8E%B0%E6%8E%92%E5%88%97%E5%9E%8B%E6%9E%9A%E4%B8%BE.md)\n##### [95、你玩过“拉灯”游戏吗？](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BD%A0%E7%8E%A9%E8%BF%87%E2%80%9C%E6%8B%89%E7%81%AF%E2%80%9D%E6%B8%B8%E6%88%8F%E5%90%97%EF%BC%9F.md)\n##### [96、奇怪的汉诺塔](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%A5%87%E6%80%AA%E7%9A%84%E6%B1%89%E8%AF%BA%E5%A1%94.md)\n##### [97、约数之和](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%BA%A6%E6%95%B0%E4%B9%8B%E5%92%8C.md)\n##### [98、分形之城](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%88%86%E5%BD%A2%E4%B9%8B%E5%9F%8E..md)\n##### [99、激光炸弹](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%BF%80%E5%85%89%E7%82%B8%E5%BC%B9.md)\n##### [100、增减序列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%A2%9E%E5%87%8F%E5%BA%8F%E5%88%97.md)\n##### [101、最高的牛](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%80%E9%AB%98%E7%9A%84%E7%89%9B.md)\n##### [102、最佳牛围栏](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%80%E4%BD%B3%E7%89%9B%E5%9B%B4%E6%A0%8F.md)\n##### [103、电影](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%94%B5%E5%BD%B1.md)\n##### [104、货仓选址](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%B4%A7%E4%BB%93%E9%80%89%E5%9D%80.md)\n##### [105、七夕祭](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%B8%83%E5%A4%95%E7%A5%AD.md)\n##### [106、动态中位数](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%8A%A8%E6%80%81%E4%B8%AD%E4%BD%8D%E6%95%B0.md)\n##### [107、超快速排序](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%B6%85%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F.md)\n##### [108、奇数码问题](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%A5%87%E6%95%B0%E7%A0%81%E9%97%AE%E9%A2%98.md)\n##### [109、天才ACM](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%A4%A9%E6%89%8DACM.md)\n##### [110、防晒](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%98%B2%E6%99%92.md)\n##### [111、畜栏预定](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%95%9C%E6%A0%8F%E9%A2%84%E5%AE%9A.md)\n##### [112、雷达设备](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%9B%B7%E8%BE%BE%E8%AE%BE%E5%A4%87%20.md)\n##### [113、特殊排序](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%89%B9%E6%AE%8A%E6%8E%92%E5%BA%8F.md)\n##### [114、国王游戏](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%9B%BD%E7%8E%8B%E6%B8%B8%E6%88%8F.md)\n##### [115、给树染色](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%BB%99%E6%A0%91%E6%9F%93%E8%89%B2.md)\n##### [116、飞行员兄弟](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%A3%9E%E8%A1%8C%E5%91%98%E5%85%84%E5%BC%9F.md)\n##### [117、占卜DIY](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%8D%A0%E5%8D%9CDIY%20.md)\n##### [118、分形](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%88%86%E5%BD%A2.md)\n##### [119、袭击](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%A2%AD%E5%87%BB.md)\n##### [120、防线](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%98%B2%E7%BA%BF.md)\n##### [121、赶牛入圈](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%B5%B6%E7%89%9B%E5%85%A5%E5%9C%88.md)\n##### [122、糖果传递](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%B3%96%E6%9E%9C%E4%BC%A0%E9%80%92.md)\n##### [123、士兵](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%A3%AB%E5%85%B5.md)\n##### [124、数的进制转换](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E7%9A%84%E8%BF%9B%E5%88%B6%E8%BD%AC%E6%8D%A2.md)\n##### [125、耍杂技的牛](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%80%8D%E6%9D%82%E6%8A%80%E7%9A%84%E7%89%9B.md)\n##### [126、最大的和](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%80%E5%A4%A7%E7%9A%84%E5%92%8C.md)\n##### [127、任务](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E4%BB%BB%E5%8A%A1.md)\n##### [128、编辑器](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%BC%96%E8%BE%91%E5%99%A8.md)\n##### [129、火车进栈](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%81%AB%E8%BD%A6%E8%BF%9B%E6%A0%88.md)\n##### [130、火车进出栈问题](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%81%AB%E8%BD%A6%E8%BF%9B%E5%87%BA%E6%A0%88%E9%97%AE%E9%A2%98.md)\n##### [131、直方图中最大的矩形](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E7%9B%B4%E6%96%B9%E5%9B%BE%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%E7%9F%A9%E5%BD%A2.md)\n##### [132、小组队列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%B0%8F%E7%BB%84%E9%98%9F%E5%88%97.md)\n##### [133、蚯蚓](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%9A%AF%E8%9A%93.md)\n##### [134、双端队列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%8F%8C%E7%AB%AF%E9%98%9F%E5%88%97.md)\n##### [135、最大子序和](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%80%E5%A4%A7%E5%AD%90%E5%BA%8F%E5%92%8C.md)\n##### [136、邻值查找](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E9%82%BB%E5%80%BC%E6%9F%A5%E6%89%BE.md)\n##### [137、是否存在两片形状相同的雪花?](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%E4%B8%A4%E7%89%87%E5%BD%A2%E7%8A%B6%E7%9B%B8%E5%90%8C%E7%9A%84%E9%9B%AA%E8%8A%B1%3F.md)\n##### [138、兔子与兔子](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%85%94%E5%AD%90%E4%B8%8E%E5%85%94%E5%AD%90.md)            \n##### [139、回文子串的最大长度](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2%E7%9A%84%E6%9C%80%E5%A4%A7%E9%95%BF%E5%BA%A6.md)   \n##### [140、后缀数组](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%90%8E%E7%BC%80%E6%95%B0%E7%BB%84.md)              \n##### [141、周期](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%91%A8%E6%9C%9F.md)                  \n##### [142、前缀统计](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%89%8D%E7%BC%80%E7%BB%9F%E8%AE%A1.md)             \n##### [143、最大异或对](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%80%E5%A4%A7%E5%BC%82%E6%88%96%E5%AF%B9.md)            \n##### [144、最长异或值路径](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%9C%80%E9%95%BF%E5%BC%82%E6%88%96%E5%80%BC%E8%B7%AF%E5%BE%84.md)        \n##### [145、超市](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%B6%85%E5%B8%82.md)                  \n##### [146、序列](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%BA%8F%E5%88%97.md)                  \n##### [147、数据备份](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%95%B0%E6%8D%AE%E5%A4%87%E4%BB%BD.md)              \n##### [148、合并果子](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E5%90%88%E5%B9%B6%E6%9E%9C%E5%AD%90.md)              \n##### [149、荷马史诗](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E8%8D%B7%E9%A9%AC%E5%8F%B2%E8%AF%97.md)              \n##### [150、括号画家](https://github.com/0voice/campus_recruitmen_questions/blob/main/%E5%89%91%E6%8C%87offer/%E6%8B%AC%E5%8F%B7%E7%94%BB%E5%AE%B6.md)              \n##### 151、表达式计算4           \n##### 152、城市游戏              \n##### 153、双栈排序              \n##### 154、滑动窗口              \n##### 155、内存分配              \n##### 156、矩阵                  \n##### 157、树形地铁系统          \n##### 158、项链                  \n##### 159、奶牛矩阵              \n##### 160、匹配统计              \n##### 161、电话列表              \n##### 162、黑盒子                \n##### 163、生日礼物              \n##### 164、可达性统计            \n##### 165、小猫爬山              \n##### 166、数独                  \n##### 167、木棒                  \n##### 168、生日蛋糕              \n##### 169、数独2                 \n##### 170、加成序列              \n##### 171、送礼物                \n##### 172、立体推箱子            \n##### 173、矩阵距离              \n##### 174、推箱子                \n##### 175、电路维修              \n##### 176、装满的油箱            \n##### 177、噩梦                  \n##### 178、第K短路               \n##### 179、八数码                \n##### 180、排书                  \n##### 181、回转游戏              \n##### 182、破坏正方形            \n##### 183、靶形数独              \n##### 184、虫食算                \n##### 185、玛雅游戏              \n##### 186、巴士                  \n##### 187、导弹防御系统          \n##### 188、武士风度的牛          \n##### 189、乳草的入侵            \n##### 190、字串变换              \n##### 191、天气预报              \n##### 192、立体推箱子2           \n##### 193、算乘方的牛            \n##### 194、涂满它！              \n##### 195、骑士精神              \n##### 196、质数距离              \n##### 197、阶乘分解              \n##### 198、反素数                \n##### 199、余数之和              \n##### 200、Hankson的趣味题       \n##### 201、可见的点              \n##### 202、最幸运的数字          \n##### 203、同余方程              \n##### 204、表达整数的奇怪方式    \n##### 205、斐波那契              \n##### 206、石头游戏              \n##### 207、球形空间产生器        \n##### 208、开关问题              \n##### 209、装备购买              \n##### 210、异或运算              \n##### 211、计算系数              \n##### 212、计数交换              \n##### 213、古代猪文              \n##### 214、Devu和鲜花            \n##### 215、破译密码              \n##### 216、Rainbow的信号         \n##### 217、绿豆蛙的归宿          \n##### 218、扑克牌                \n##### 219、剪纸游戏              \n##### 220、最大公约数            \n##### 221、龙哥的问题            \n##### 222、青蛙的约会            \n##### 223、阿九大战朱最学        \n##### 224、计算器                \n##### 225、矩阵幂求和            \n##### 226、233矩阵               \n##### 227、小部件厂              \n##### 228、异或                  \n##### 229、新NIM游戏             \n##### 230、排列计数              \n##### 231、天码                  \n##### 232、守卫者的挑战          \n##### 233、换教室                \n##### 234、放弃测试              \n##### 235、魔法珠                \n##### 236、格鲁吉亚和鲍勃        \n##### 237、程序自动分析          \n##### 238、银河英雄传说          \n##### 239、奇偶游戏              \n##### 240、食物链                \n##### 241、楼兰图腾              \n##### 242、一个简单的整数问题    \n##### 243、一个简单的整数问题2   \n##### 244、谜一样的牛            \n##### 245、你能回答这些问题吗    \n##### 246、区间最大公约数        \n##### 247、亚特兰蒂斯            \n##### 248、窗内的星星            \n##### 249、蒲公英                \n##### 250、磁力块                \n##### 251、小Z的袜子             \n##### 252、树                    \n##### 253、普通平衡树            \n##### 254、天使玩偶              \n##### 255、第K小数               \n##### 256、最大异或和            \n##### 257、关押罪犯              \n##### 258、石头剪子布            \n##### 259、真正的骗子            \n##### 260、买票                  \n##### 261、旅馆                  \n##### 262、海报                  \n##### 263、作诗                  \n##### 264、权值                  \n##### 265、营业额统计            \n##### 266、超级备忘录            \n##### 267、莫基亚                \n##### 268、流星                  \n##### 269、Fotile模拟赛L         \n##### 270、可持久化并查集加强版  \n##### 271、杨老师的照相排列      \n##### 272、最长公共上升子序列    \n##### 273、分级                  \n##### 274、移动服务              \n##### 275、传纸条                \n##### 276、I-区域                \n##### 277、饼干                  \n##### 278、数字组合              \n##### 279、自然数拆分            \n##### 280、陪审团                \n##### 281、硬币                  \n##### 282、石子合并              \n##### 283、多边形                \n##### 284、金字塔                \n##### 285、没有上司的舞会        \n##### 286、选课                  \n##### 287、积蓄程度              \n##### 288、休息时间              \n##### 289、环路运输              \n##### 290、坏掉的机器人          \n##### 291、蒙德里安的梦想        \n##### 292、炮兵阵地              \n##### 293、开车旅行              \n##### 294、计算重复              \n##### 295、清理班次              \n##### 296、清理班次2             \n##### 297、赤壁之战              \n##### 298、围栏                  \n##### 299、裁剪序列              \n##### 300、任务安排1             \n##### 301、任务安排2             \n##### 302、任务安排3             \n##### 303、运输小猫              \n##### 304、诗人小G               \n##### 305、一个古老的石头游戏    \n##### 306、杰拉尔德和巨型象棋    \n##### 307、连通图                \n##### 308、它们中的多少个        \n##### 309、装饰围栏              \n##### 310、启示录                \n##### 311、月之谜                \n##### 312、乌龟棋                \n##### 313、花店橱窗              \n##### 314、低买                  \n##### 315、旅行                  \n##### 316、减操作                \n##### 317、陨石的秘密            \n##### 318、划分大理石            \n##### 319、折叠序列              \n##### 320、能量项链              \n##### 321、棋盘分割              \n##### 322、消木块                \n##### 323、战略游戏              \n##### 324、贿赂FIPA              \n##### 325、计算机                \n##### 326、XOR和路径             \n##### 327、玉米田                \n##### 328、芯片                  \n##### 329、围栏障碍训练场        \n##### 330、估算                  \n##### 331、干草堆                \n##### 332、股票交易              \n##### 333、最大子矩阵            \n##### 334、K匿名序列             \n##### 335、特别行动队            \n##### 336、邮局                  \n##### 337、扑克牌                \n##### 338、计数问题              \n##### 339、圆形数字              \n##### 340、通信线路              \n##### 341、最优贸易              \n##### 342、道路与航线            \n##### 343、排序                  \n##### 344、观光之旅              \n##### 345、牛站                  \n##### 346、走廊泼水节            \n##### 347、野餐规划              \n##### 348、沙漠之王              \n##### 349、黑暗城堡              \n##### 350、巡逻                  \n##### 351、树网的核              \n##### 352、闇の連鎖               \n##### 353、雨天的尾巴            \n##### 354、天天爱跑步            \n##### 355、异象石                \n##### 356、次小生成树            \n##### 357、疫情控制              \n##### 358、岛屿                  \n##### 359、创世纪                \n##### 360、Freda的传呼机         \n##### 361、观光奶牛              \n##### 362、区间                  \n##### 363、B城                   \n##### 364、网络                  \n##### 365、圆桌骑士              \n##### 366、看牛                  \n##### 367、学校网络              \n##### 368、银河                  \n##### 369、北大ACM队的远足       \n##### 370、卡图难题              \n##### 371、牧师约翰最忙碌的一天  \n##### 372、棋盘覆盖              \n##### 373、車的放置              \n##### 374、导弹防御塔            \n##### 375、蚂蚁                  \n##### 376、机器任务              \n##### 377、泥泞的区域            \n##### 378、骑士放置              \n##### 379、捉迷藏                \n##### 380、舞动的夜晚            \n##### 381、有线电视网络          \n##### 382、K取方格数             \n##### 383、观光                  \n##### 384、升降梯上              \n##### 385、GF和猫咪的玩具        \n##### 386、社交网络              \n##### 387、北极网络              \n##### 388、四叶草魔杖            \n##### 389、直径                  \n##### 390、逃学的小孩            \n##### 391、聚会                  \n##### 392、会合                  \n##### 393、雇佣收银员            \n##### 394、最优高铁环            \n##### 395、冗余路径              \n##### 396、矿场搭建              \n##### 397、逃不掉的路            \n##### 398、交通实时查询系统      \n##### 399、约翰的旅行            \n##### 400、太鼓达人              \n##### 401、从u到v还是从v到u？       \n##### 402、杀人游戏                 \n##### 403、平面                     \n##### 404、婚礼                     \n##### 405、将他们分好队             \n##### 406、放置机器人               \n##### 407、稳定的牛分配             \n##### 408、回家                     \n##### 409、空袭                     \n##### 410、排版幻灯片               \n##### 411、国王的任务               \n##### 412、排水沟                   \n##### 413、乒乓球                   \n##### 414、数字游戏                 \n##### 415、栈                       \n##### 416、麦森数                   \n##### 417、不高兴的津津             \n##### 418、花生采摘                 \n##### 419、FBI树                    \n##### 420、火星人                   \n##### 421、陶陶摘苹果               \n##### 422、校门外的树               \n##### 423、采药                     \n##### 424、循环                     \n##### 425、明明的随机数             \n##### 426、开心的金明               \n##### 427、Jam的计数法              \n##### 428、数列                     \n##### 429、奖学金                   \n##### 430、纪念品分组               \n##### 431、守望者的逃离             \n##### 432、Hanoi双塔问题            \n##### 433、ISBN号码                 \n##### 434、排座椅                   \n##### 435、传球游戏                 \n##### 436、立体图                   \n##### 437、多项式输出               \n##### 438、分数线划定               \n##### 439、细胞分裂                 \n##### 440、道路游戏                 \n##### 441、数字统计                 \n##### 442、接水问题                 \n##### 443、导弹拦截                 \n##### 444、三国游戏                 \n##### 445、数字反转                 \n##### 446、统计单词数               \n##### 447、瑞士轮                   \n##### 448、表达式的值               \n##### 449、质因数分解               \n##### 450、寻宝                     \n##### 451、摆花                     \n##### 452、文化之旅                 \n##### 453、计数问题                 \n##### 454、表达式求值               \n##### 455、小朋友的数字             \n##### 456、车站分级                 \n##### 457、珠心算测验               \n##### 458、比例简化                 \n##### 459、螺旋矩阵                 \n##### 460、子矩阵                   \n##### 461、金币                     \n##### 462、扫雷游戏                 \n##### 463、求和                     \n##### 464、推销员                   \n##### 465、买铅笔                   \n##### 466、回文日期                 \n##### 467、海港                     \n##### 468、魔法阵                   \n##### 469、成绩                     \n##### 470、图书管理员               \n##### 471、棋盘                     \n##### 472、跳房子                   \n##### 473、标题统计                 \n##### 474、龙虎斗                   \n##### 475、摆渡车                   \n##### 476、对称二叉树               \n##### 477、神经网络                 \n##### 478、侦探推理                 \n##### 479、加分二叉树               \n##### 480、传染病控制               \n##### 481、津津的储蓄计划           \n##### 482、合唱队形                 \n##### 483、谁拿了最多奖学金         \n##### 484、过河                     \n##### 485、篝火晚会                 \n##### 486、等价表达式               \n##### 487、金明的预算方案           \n##### 488、作业调度方案             \n##### 489、2^k进制数                \n##### 490、统计数字                 \n##### 491、字符串的展开             \n##### 492、矩阵取数游戏             \n##### 493、笨小猴                   \n##### 494、火柴棒等式               \n##### 495、潜伏者                   \n##### 496、机器翻译                 \n##### 497、引水入城                 \n##### 498、铺地毯                   \n##### 499、聪明的质监员             \n##### 500、选择客栈                 \n##### 501、观光巴士                 \n##### 502、Vigenère 密码            \n##### 503、借教室                   \n##### 504、转圈游戏                 \n##### 505、火柴排队                 \n##### 506、货车运输                 \n##### 507、积木大赛                 \n##### 508、花匠                     \n##### 509、华容道                   \n##### 510、生活大爆炸版石头剪刀布   \n##### 511、联合权值                 \n##### 512、飞扬的小鸟               \n##### 513、无线网络发射器选址       \n##### 514、寻找道路                 \n##### 515、解方程                   \n##### 516、神奇的幻方               \n##### 517、信息传递                 \n##### 518、斗地主                   \n##### 519、跳石头                   \n##### 520、子串                     \n##### 521、运输计划                 \n##### 522、玩具谜题                 \n##### 523、组合数问题               \n##### 524、愤怒的小鸟               \n##### 525、小凯的疑惑               \n##### 526、时间复杂度               \n##### 527、逛公园                   \n##### 528、奶酪                     \n##### 529、宝藏                     \n##### 530、列队                     \n##### 531、铺设道路                 \n##### 532、货币系统                 \n##### 533、赛道修建                 \n##### 534、旅行                     \n##### 535、填数游戏                 \n##### 536、保卫王国                 \n##### 537、偶数                     \n##### 538、幸运倾角                 \n##### 539、拼凑单词                 \n##### 540、不含九                   \n##### 541、夏洛克和比特串           \n##### 542、国王的巡回               \n##### 543、行星距离                 \n##### 544、仙女和女巫               \n##### 545、Kickstart闹钟            \n##### 546、糖果                     \n##### 547、滑翔伞                   \n##### 548、最有趣的单词搜索         \n##### 549、训练                     \n##### 550、包裹                     \n##### 551、抢票                     \n##### 552、酸奶                     \n##### 553、奶茶                     \n##### 554、棋盘游戏                 \n##### 555、相同字母异序词           \n##### 556、专业村                   \n##### 557、回文序列                 \n##### 558、乘积三元组               \n##### 559、整合班级                 \n##### 560、逃离洞穴                 \n##### 561、大按钮                   \n##### 562、壁画                     \n##### 563、让我算下方案数           \n##### 564、正方形计数               \n##### 565、标识重叠                 \n##### 566、空间立方体               \n##### 567、硬币                     \n##### 568、奇妙的数列               \n##### 569、猜拳游戏                 \n##### 570、气球游戏                 \n##### 571、数学编码器               \n##### 572、中心                     \n##### 573、圣诞树                   \n##### 574、模糊的密码               \n##### 575、X方阵                    \n##### 576、神奇的思考               \n##### 577、4M公司                   \n##### 578、去观光                   \n##### 579、夏洛克和矩阵游戏         \n##### 580、扔垃圾                   \n##### 581、复制粘贴                 \n##### 582、梯形计数                 \n##### 583、黑洞                     \n##### 584、Kicksort排序             \n##### 585、舞蹈对决                 \n##### 586、抓住它们                 \n##### 587、吃蛋糕                   \n##### 588、巨大的数                 \n##### 589、卡片游戏                 \n##### 590、矩阵切割                 \n##### 591、国家领导者               \n##### 592、雨                       \n##### 593、简的花店                 \n##### 594、皇家大战                 \n##### 595、夏洛克和括号             \n##### 596、夏洛克与华生的健身房秘密 \n##### 597、华生与间隔               \n##### 598、夏洛克与排序             \n##### 599、发射站                   \n##### 600、仰视奶牛                 \n##### 601、小Q购物                  \n##### 602、01串                     \n##### 603、打怪兽                   \n##### 604、圆的面积                 \n##### 605、简单乘积                 \n##### 606、平均数1                  \n##### 607、平均数2                  \n##### 608、差                       \n##### 609、工资                     \n##### 610、工资和奖金               \n##### 611、简单计算                 \n##### 612、球的体积                 \n##### 613、面积                     \n##### 614、最大值                   \n##### 615、油耗                     \n##### 616、两点间的距离             \n##### 617、距离                     \n##### 618、燃料消耗                 \n##### 619、怪物路径                 \n##### 620、安全区                   \n##### 621、赋值                     \n##### 622、士兵                     \n##### 623、投票                     \n##### 624、坐                       \n##### 625、Codejamon暗号            \n##### 626、橡皮筋                   \n##### 627、排灯节照明               \n##### 628、美丽的数                 \n##### 629、放球                     \n##### 630、数组排序                 \n##### 631、Googol字符串             \n##### 632、g立方体                  \n##### 633、G校园                    \n##### 634、g贪吃蛇                  \n##### 635、旅游                     \n##### 636、g轮                      \n##### 637、g数字                    \n##### 638、Albocede DNA             \n##### 639、g排名                    \n##### 640、g文件                    \n##### 641、g联赛                    \n##### 642、g矩阵                    \n##### 643、动态网格                 \n##### 644、g气球                    \n##### 645、IP地址摘要               \n##### 646、虚拟兔子                 \n##### 647、懒惰拼字赛               \n##### 648、机器人摇滚乐队           \n##### 649、不是那么随机             \n##### 650、和之和                   \n##### 651、逛画展                   \n##### 652、切蛋糕                   \n##### 653、钞票                     \n##### 654、时间转换                 \n##### 655、天数转换                 \n##### 656、钞票和硬币               \n##### 657、选择练习1                \n##### 658、一元二次方程公式         \n##### 659、区间                     \n##### 660、零食                     \n##### 661、平均数3                  \n##### 662、点的坐标                 \n##### 663、简单排序                 \n##### 664、三角形                   \n##### 665、倍数                     \n##### 666、三角形类型               \n##### 667、游戏时间                 \n##### 668、游戏时间2                \n##### 669、加薪                     \n##### 670、动物                     \n##### 671、DDD                      \n##### 672、税                       \n##### 673、七段显示器               \n##### 674、超级2048                 \n##### 675、加法                     \n##### 676、切瓷砖                   \n##### 677、找零                     \n##### 678、万万没想到之聪明的编辑   \n##### 679、奖品分配                 \n##### 680、剪绳子                   \n##### 681、疏散人群                 \n##### 682、丢失的序列               \n##### 683、密码攻击者               \n##### 684、除夕夜                   \n##### 685、卡牌游戏                 \n##### 686、括号顺序                 \n##### 687、扫雷                     \n##### 688、乘坐地铁                 \n##### 689、坏掉的计算器             \n##### 690、俄罗斯方块               \n##### 691、立方体IV                 \n##### 692、G巴士计数                \n##### 693、行程排序                 \n##### 694、国际象棋                 \n##### 695、劣马                     \n##### 696、哈默队长                 \n##### 697、蒙斯特                   \n##### 698、读电话号码               \n##### 699、有理数树                 \n##### 700、排序                     \n##### 701、穿越迷宫                 \n##### 702、太空船防卫               \n##### 703、数独检查                 \n##### 704、见面和派对               \n##### 705、六边形                   \n##### 706、龙迷宫                   \n##### 707、忽略注释                 \n##### 708、偶数                     \n##### 709、奇数                     \n##### 710、六个奇数                 \n##### 711、乘法表                   \n##### 712、正数                     \n##### 713、区间 2                   \n##### 714、连续奇数的和 1           \n##### 715、余数                     \n##### 716、最大数和它的位置         \n##### 717、简单斐波那契             \n##### 718、实验                     \n##### 719、连续奇数的和 2           \n##### 720、连续整数相加             \n##### 721、递增序列                 \n##### 722、数字序列和它的和         \n##### 723、PUM                      \n##### 724、约数                     \n##### 725、完全数                   \n##### 726、质数                     \n##### 727、菱形                     \n##### 728、变身程序员               \n##### 729、特征提取                 \n##### 730、机器人跳跃问题           \n##### 731、毕业旅行问题             \n##### 732、过河                     \n##### 733、构建回文                 \n##### 734、能量石                   \n##### 735、多样性子阵               \n##### 736、安迪种树                 \n##### 737、数组替换                 \n##### 738、数组填充                 \n##### 739、数组选择                 \n##### 740、数组变换                 \n##### 741、斐波那契数列             \n##### 742、最小数和它的位置         \n##### 743、数组中的行               \n##### 744、数组中的列               \n##### 745、数组的右上半部分         \n##### 746、数组的左下半部分         \n##### 747、数组的左上半部分         \n##### 748、数组的右下半部分         \n##### 749、数组的上方区域           \n##### 750、数组的下方区域           \n##### 751、数组的左方区域           \n##### 752、数组的右方区域           \n##### 753、平方矩阵 I               \n##### 754、平方矩阵 II              \n##### 755、平方矩阵 III             \n##### 756、蛇形矩阵                 \n##### 757、修改矩阵                 \n##### 758、切割树                   \n##### 759、格子染色                 \n##### 760、字符串长度               \n##### 761、字符串中的数字个数       \n##### 762、字符串匹配               \n##### 763、循环相克令               \n##### 764、输出字符串               \n##### 765、字符串加空格             \n##### 766、去掉多余的空格           \n##### 767、信息加密                 \n##### 768、忽略大小写比较字符串大小 \n##### 769、替换字符                 \n##### 770、单词替换                 \n##### 771、字符串中最长的连续出现的字符\n##### 772、只出现一次的字符         \n##### 773、字符串插入               \n##### 774、最长单词                 \n##### 775、倒排单词                 \n##### 776、字符串移位包含问题       \n##### 777、字符串乘方               \n##### 778、字符串最大跨距           \n##### 779、最长公共字符串后缀       \n##### 780、爱健身的小王             \n##### 781、趣味字母卡片             \n##### 782、避嫌抢劫                 \n##### 783、括号序列                 \n##### 784、强盗团伙                 \n##### 785、快速排序                 \n##### 786、第k个数                  \n##### 787、归并排序                 \n##### 788、逆序对的数量             \n##### 789、数的范围                 \n##### 790、数的三次方根             \n##### 791、高精度加法               \n##### 792、高精度减法               \n##### 793、高精度乘法               \n##### 794、高精度除法               \n##### 795、前缀和                   \n##### 796、子矩阵的和               \n##### 797、差分                     \n##### 798、差分矩阵                 \n##### 799、最长连续不重复子序列     \n##### 800、数组元素的目标和         \n##### 801、二进制中1的个数          \n##### 802、区间和                   \n##### 803、区间合并                 \n##### 804、n的阶乘                  \n##### 805、x和y的最大值             \n##### 806、两个数的和               \n##### 807、区间求和                 \n##### 808、最大公约数               \n##### 809、最小公倍数               \n##### 810、绝对值                   \n##### 811、交换数值                 \n##### 812、打印数字                 \n##### 813、打印矩阵                 \n##### 814、复制数组                 \n##### 815、打印字符串               \n##### 816、数组翻转                 \n##### 817、数组去重                 \n##### 818、数组排序                 \n##### 819、递归求阶乘               \n##### 820、递归求斐波那契数列       \n##### 821、跳台阶                   \n##### 822、走方格                   \n##### 823、排列                     \n##### 824、取现金                   \n##### 825、排队购物                 \n##### 826、单链表                   \n##### 827、双链表                   \n##### 828、模拟栈                   \n##### 829、模拟队列                 \n##### 830、单调栈                   \n##### 831、KMP字符串                \n##### 832、摆动行走                 \n##### 833、电路板                   \n##### 834、看狗                     \n##### 835、Trie字符串统计           \n##### 836、合并集合                 \n##### 837、连通块中点的数量         \n##### 838、堆排序                   \n##### 839、模拟堆                   \n##### 840、模拟散列表               \n##### 841、字符串哈希               \n##### 842、排列数字                 \n##### 843、n-皇后问题               \n##### 844、走迷宫                   \n##### 845、八数码                   \n##### 846、树的重心                 \n##### 847、图中点的层次             \n##### 848、有向图的拓扑序列         \n##### 849、Dijkstra求最短路 I       \n##### 850、Dijkstra求最短路 II      \n##### 851、spfa求最短路             \n##### 852、spfa判断负环             \n##### 853、有边数限制的最短路       \n##### 854、Floyd求最短路            \n##### 855、立方体塔                 \n##### 856、变量名拆分               \n##### 857、宝石迷阵                 \n##### 858、Prim算法求最小生成树     \n##### 859、Kruskal算法求最小生成树  \n##### 860、染色法判定二分图         \n##### 861、二分图的最大匹配         \n##### 862、三元组排序               \n##### 863、国庆旅行                 \n##### 864、二维数组区块计数         \n##### 865、字符串展开               \n##### 866、试除法判定质数           \n##### 867、分解质因数               \n##### 868、筛质数                   \n##### 869、试除法求约数             \n##### 870、约数个数                 \n##### 871、约数之和                 \n##### 872、最大公约数               \n##### 873、欧拉函数                 \n##### 874、筛法求欧拉函数           \n##### 875、快速幂                   \n##### 876、快速幂求逆元             \n##### 877、扩展欧几里得算法         \n##### 878、线性同余方程             \n##### 879、幸存者游戏               \n##### 880、数字对生成树             \n##### 881、整理书架                 \n##### 882、飞机最低可俯冲高度       \n##### 883、高斯消元解线性方程组     \n##### 884、高斯消元解异或线性方程组 \n##### 885、求组合数 I               \n##### 886、求组合数 II              \n##### 887、求组合数 III             \n##### 888、求组合数 IV              \n##### 889、满足条件的01序列         \n##### 890、能被整除的数             \n##### 891、Nim游戏                  \n##### 892、台阶-Nim游戏             \n##### 893、集合-Nim游戏             \n##### 894、拆分-Nim游戏             \n##### 895、最长上升子序列           \n##### 896、最长上升子序列 II        \n##### 897、最长公共子序列           \n##### 898、数字三角形               \n##### 899、编辑距离                 \n##### 900、整数划分                 \n##### 901、滑雪                     \n##### 902、最短编辑距离             \n##### 903、昂贵的聘礼               \n##### 904、虫洞                     \n##### 905、区间选点                 \n##### 906、区间分组                 \n##### 907、区间覆盖                 \n##### 908、最大不相交区间数量       \n##### 909、下棋游戏                 \n##### 910、X还是什么？              \n##### 911、最后一个客人             \n##### 912、小吃摊                   \n##### 913、排队打水                 \n##### 914、樱桃网                   \n##### 915、编码美食切换机           \n##### 916、街头跳棋                 \n##### 917、树上操作                 \n##### 918、软件包管理器             \n##### 919、竞赛排名                 \n##### 920、最优乘车                 \n##### 921、文件匹配                 \n##### 922、最佳游览                 \n##### 923、积木游戏                 \n##### 924、卫星覆盖                 \n##### 925、个人所得税               \n##### 926、免费馅饼                 \n##### 928、围巾裁剪                 \n##### 929、SERNET模拟               \n##### 931、01串                     \n##### 932、钉子和小球               \n##### 933、最优连通子集             \n##### 934、瓷片项链                 \n##### 935、程序分析器               \n##### 936、古城之谜                 \n##### 937、单词查找树               \n##### 938、青蛙过河                 \n##### 939、算符破译                 \n##### 940、反正切函数的应用         \n##### 941、聪明的打字员             \n##### 942、方程的解数               \n##### 943、贪吃的九头龙             \n##### 944、荒岛野人                 \n##### 945、机器人M号                \n##### 946、木棒游戏                 \n##### 947、文本编辑器               \n##### 948、智破连环阵               \n##### 949、地精部落                 \n##### 950、郁闷的出纳员             \n##### 951、曼哈顿                   \n##### 952、降雨量                   \n##### 953、小H的小屋                \n##### 954、瑰丽华尔兹               \n##### 955、维护数列                 \n##### 956、智慧珠游戏               \n##### 957、聪聪与可可               \n##### 958、月下柠檬树               \n##### 959、网络收费                 \n##### 960、千年虫                   \n##### 961、最大获利                 \n##### 962、神奇口袋                 \n##### 963、货币兑换                 \n##### 964、项链工厂                 \n##### 965、生成树计数               \n##### 967、假面舞会                 \n##### 968、设计路线                 \n##### 969、志愿者招募               \n##### 970、奥运物流                 \n##### 971、糖果雨                   \n##### 972、变换序列                 \n##### 973、二叉查找树               \n##### 974、植物大战僵尸             \n##### 975、管道取珠                 \n##### 976、能量采集                 \n##### 977、超级钢琴                 \n##### 978、海拔                     \n##### 979、航空管制                 \n##### 980、旅行路线                 \n##### 981、兔农                     \n##### 982、智能车比赛               \n##### 983、阿狸的打字机             \n##### 984、道路修建                 \n##### 985、NOI嘉年华                \n##### 986、兔兔与蛋蛋游戏           \n##### 987、随机数生成器             \n##### 988、骑行川藏                 \n##### 989、魔幻棋盘                 \n##### 990、迷失游乐园               \n##### 991、美食节                   \n##### 992、向量内积                 \n##### 993、树的计数                 \n##### 994、矩阵游戏                 \n##### 995、书法家                   \n##### 996、快餐店                   \n##### 997、阶乘字符串               \n##### 998、起床困难综合症           \n##### 999、魔法森林                 \n##### 1000、动物园                  \n##### 1001、随机数生成器            \n##### 1002、购票                    \n##### 1003、寿司晚宴                \n\n\u003cbr\u003e\n\n\u003ch3 id=\"3\"\u003e:medal_military: leetcode\u003c/h3\u003e \n\n---\n##### [1、（0001）两数之和](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md)\n##### [2、（0002）两数相加](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md)\n##### [3、（0003）无重复字符的最长子串](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md)\n##### [4、（0004）寻找两个正序数组的中位数](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%AD%A3%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0%C2%A0.md)\n##### [5、（0005）最长回文子串](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md)\n##### [6、（0006）zigzag conversion(Z 字形变换)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/Z%20%E5%AD%97%E5%BD%A2%E5%8F%98%E6%8D%A2.md)\n##### [7、（0007）reverse integer(整数反转)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%95%B4%E6%95%B0%E5%8F%8D%E8%BD%AC.md)\n##### [8、（0008）atoi(字符串转换整数)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%95%B4%E6%95%B0.md)\n##### [9、（0009）palindrome number(回文数)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%9B%9E%E6%96%87%E6%95%B0.md)\n##### [10、（0010）regular expression matching(正则表达式匹配)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md)\n##### [11、（0011）盛最多水的容器](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.md)\n##### [12、（0012）roman numeral(整数转罗马数字)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%95%B4%E6%95%B0%E8%BD%AC%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97.md)\n##### [13、（0013）roman to integer(罗马数字转整数)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97%E8%BD%AC%E6%95%B4%E6%95%B0.md)\n##### [14、（0014）longest common prefix(最长公共前缀)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md)\n##### [15、（0015）三数之和](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md)\n##### [16、（0016）three sum closest(最接近的三数之和)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md)\n##### [17、（0017）电话号码的字母组合](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.md)\n##### [18、（0018）four sum](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md)\n##### [19、（0019）删除链表的倒数第 N 个节点](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%AC%20N%20%E4%B8%AA%E7%BB%93%E7%82%B9.md)\n##### [20、（0020）有效的括号](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md)\n##### [21、（0021）合并两个有序链表](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.md)\n##### [22、（0022）括号生成](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.md)\n##### [23、（0023）合并 K 个升序链表](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%90%88%E5%B9%B6K%E4%B8%AA%E5%8D%87%E5%BA%8F%E9%93%BE%E8%A1%A8.md)\n##### [24、（0024）两两交换链表中的节点](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md)\n##### [25、（0025）K 个一组翻转链表](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/K%20%E4%B8%AA%E4%B8%80%E7%BB%84%E7%BF%BB%E8%BD%AC%E9%93%BE%E8%A1%A8.md)\n##### [26、（0026）删除排序数组中的重复项](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%88%A0%E9%99%A4%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E9%A1%B9.md)\n##### [27、（0027）remove element(移除元素)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.md)\n##### [28、（0028）implement strstr(实现 strStr())](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%AE%9E%E7%8E%B0%20strStr().md)\n##### [29、（0029）两数相除](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E4%B8%A4%E6%95%B0%E7%9B%B8%E9%99%A4.md)\n##### [30、（0030）串联所有单词的子串](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E4%B8%B2%E8%81%94%E6%89%80%E6%9C%89%E5%8D%95%E8%AF%8D%E7%9A%84%E5%AD%90%E4%B8%B2.md)\n##### [31、（0031）下一个排列](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%8E%92%E5%88%97.md)\n##### [32、（0032）最长有效括号](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.md)\n##### [33、（0033）搜索旋转排序数组](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.md)\n##### [34、（0034）在排序数组中查找元素的第一个和最后一个位置](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.md)\n##### [35、（0035）search insert position(搜索插入位置)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%90%9C%E7%B4%A2%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.md)\n##### [36、（0036）valid sudoku(有效的数独)](https://github.com/0voice/campus_recruitmen_questions/blob/main/leetcode/%E6%9C%89%E6%95%88%E7%9A%84%E6%95%B0%E7%8B%AC.md)\n##### [37、（0037）sudoku solver(解数独)](https://g","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F0voice%2Fcampus_recruitmen_questions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F0voice%2Fcampus_recruitmen_questions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F0voice%2Fcampus_recruitmen_questions/lists"}