#LintCode
82 posts
LintCode 971 Surplus Value Backpack - Hard
971. Surplus Value Backpack
LintCode 960 First Unique Number In Data Stream II - Medium
960. First Unique Number in Data Stream II
LintCode 92 Backpack - Medium
描述
LintCode 90 K Sum II - Medium
90. k Sum II
LintCode 89 K Sum - Hard
89. k Sum
LintCode 845 Greatest Common Divisor - Easy
845. Greatest Common Divisor
LintCode 843 Digits Flip - Medium
LintCode 841 String Replace - Hard
841. String Replace
LintCode 839 Merge Two Sorted Interval Lists - Easy
839. Merge Two Sorted Interval Lists
LintCode 816 Traveling Salesman Problem - Hard
816. Traveling Salesman Problem
LintCode 761 Smallest Subset - Medium
761. Smallest Subset
LintCode 752 Rogue Knight Sven - Medium
752. 流浪剑客斯温
LintCode 724 Minimum Partition - Medium
724. Minimum Partition
LintCode 685 First Unique Number In Data Stream - Medium
685. First Unique Number in Data Stream
LintCode 680 Split String - Medium
680. Split String
LintCode 654 Sparse Matrix Multiplication - Medium
654. Sparse Matrix Multiplication
LintCode 630 Knight Shortest Path II - Medium
630. Knight Shortest Path II
LintCode 628 Maximum Subtree - Easy
628. Maximum Subtree
LintCode 625 Partition Array II - Medium
625. Partition Array II
LintCode 612 K Closest Points - Medium
612. K Closest Points
LintCode 611 Knight Shortest Path-II - Medium
611. Knight Shortest Path
LintCode 610 Two Sum-Difference Equals To Target - Medium
610. Two Sum - Difference equals to target
LintCode 61 Search For A Range - Medium
61. Search for a Range
LintCode 609 Two Sum-Less Than Or Eqaul To Target - Medium
609. Two Sum - Less than or equal to target
LintCode 604 Window Sum - Easy
604. Window Sum
LintCode 6 Merge Two Sorted Arrays - Easy
6. 合并排序数组 II
LintCode 596 Minimum Subtree - Easy
596. Minimum Subtree
LintCode 585 Maximum Number In Mountain Sequence - Medium
585. Maximum Number in Mountain Sequence
LintCode 584 Drop Eggs II - Medium
584. Drop Eggs II
LintCode 578 Lowest Common Ancestor III - Medium
578. Lowest Common Ancestor III
LintCode 577 Merge K Sorted Interval Lists - Medium
577. Merge K Sorted Interval Lists
LintCode 563 Backpack V - Medium
描述
LintCode 560 Friendship Service - Easy
560. Friendship Service
LintCode 553 Two Sum-Closest To Target - Medium
533. Two Sum - Closest to target
LintCode 545 Top K Largest Numbers II - Medium
545. Top k Largest Numbers II
LintCode 538 Memcache - Medium
538. Memcache
LintCode 522 Tiny URLII - Medium
522. Tiny Url II
LintCode 521 Remove Duplicate Numbers In Array - Easy
521. Remove Duplicate Numbers in Array
LintCode 502 Mini Cassandra - Medium
502. Mini Cassandra
LintCode 494 Implement Stack By Two Queues - Easy
494. Implement Stack by Two Queues
LintCode 492 Implement Queue By Linked List - Easy
492. Implement Queue by Linked List
LintCode 49 Sort Letters By Case - Medium
49. Sort Letters by Case
LintCode 474 Lowest Common Ancestor II - Easy
474. Lowest Common Ancestor II
LintCode 464 Sort Integers II - Easy
464. 整数排序 II
LintCode 462 Total Occurrence Of Target - Easy
462. Total Occurrence of Target
LintCode 461 Kth Smallest Numbers In Unsorted Array - Medium
Find the kth smallest number in an unsorted integer array.
LintCode 460 Find K Closest Elements - Medium
460. Find K Closest Elements
LintCode 458 Last Position Of Target - Easy
458. Last Position of Target
LintCode 447 Search In A Big Sorted Array - Medium
447. Search in a Big Sorted Array
LintCode 443 Two Sum-Greater Than Target - Medium
443. Two Sum - Greater than target
LintCode 440 Backpack III - Medium
给定 n 种物品, 每种物品都有无限个. 第 i 个物品的体积为 A[i], 价值为 V[i].
LintCode 437 Copy Books - Medium
给定 n 本书, 第 i 本书的页数为 pages[i]. 现在有 k 个人来复印这些书籍, 而每个人只能复印编号连续的一段的书, 比如一个人可以复印 pages[0], pages[1], pages[2], 但是不可以只复印 pages[0], pages[2], pa…
LintCode 40 Implement Queue By Two Stacks - Medium
40. Implement Queue by Two Stacks
LintCode 396 Coin In Line III - Hard
有 n 个硬币排成一条线, 第 i 枚硬币的价值为 values[i].
LintCode 394 Coin In Line - Medium
描述
LintCode 39 Recover Rotated Sorted Array - Easy
39. Recover Rotated Sorted Array
LintCode 38 Search A2 D Matrix II - Medium
38. Search a 2D Matrix II
LintCode 373 Partition Arrayby Oddand Even - Easy
373. Partition Array by Odd and Even
LintCode 254 Drop Eggs - Easy
254. Drop Eggs
LintCode 249 Count Smaller Number Before Itself - Hard
Description
LintCode 235 Prime Factorization - Easy
235. Prime Factorization
LintCode 211 String Permutation - Easy
211. String Permutation
LintCode 197 Permutation Index - Medium
197. Permutation Index
LintCode 1870 Number Of Substrings With All Zeroes - Medium
1870. number of substrings with all zeroes
LintCode 183 Wood Cut - Hard
183. Wood Cut
LintCode 1790 Rotate String II - Easy
1790. Rotate String II
LintCode 1479 Can Reach The Endpoint - Easy
1479. Can Reach The Endpoint
LintCode 144 Interleaving Positive And Negative Numbers - Medium
144. Interleaving Positive and Negative Numbers
LintCode 143 Sort Colors II - Medium
LintCode 140 Fast Power - Medium
140. Fast Power
LintCode 14 First Position Of Target - Easy
14. First Position of Target
LintCode 1375 Substring With At Least K Distinct Characters - Medium
1375. Substring With At Least K Distinct Characters
LintCode 1343 Sum Of Two Strings - Easy
1343. Sum of Two Strings
LintCode 1331 English Software - Easy
1331. English Software
LintCode 130 Heapify - Medium
130. Heapify
LintCode 129 Rehashing - Medium
129. Rehashing
LintCode 128 Hash Function - Easy
128. Hash Function
LintCode 127 Topological Sorting - Medium
127. Topological Sorting
LintCode 125 Backpack II - Medium
有 n 个物品和一个大小为 m 的背包. 给定数组 A 表示每个物品的大小和数组 V 表示每个物品的价值.
LintCode 120 Word Ladder - Hard
120. Word Ladder
LintCode 1166 Recommended Results Are Scattered - Easy
1166. Recommended Results are Scattered
LintCode 10 String Permutations II - Medium
10. String Permutation II