Ctrlk

README
t
0001_Two_Sum
0002_Add_Two_Numbers
0003_Longest_Substring_Without_Repeating_Characters
0004_Median_of_Two_Sorted_Arrays
0005_Longest_Palindromic_Substring
0006_ZigZag_Conversion
0007_Reverse_Integer
0008_String_to_Integer_(atoi)
0009_Palindrome_Number
0010_Regular_Expression_Matching
0011_Container_With_Most_Water
0012_Integer_to_Roman
0013_Roman_to_Integer
0014_Longest_Common_Prefix
0015_3Sum
0016_3Sum_Closest
0017_Letter_Combinations_of_a_Phone_Number
0018_4Sum
0019_Remove_Nth_Node_From_End_of_List
0020_Valid_Parentheses
0021_Merge_Two_Sorted_Lists
0022_Generate_Parentheses
0023_Merge_k_Sorted_Lists
0024_Swap_Nodes_in_Pairs
0025_Reverse_Nodes_in_k-Group
0026_Remove_Duplicates_from_Sorted_Array
0027_Remove_Element
0028_Implement_strStr()
0029_Divide_Two_Integers
0030_Substring_with_Concatenation_of_All_Words
0031_Next_Permutation
0032 Longest Valid Parentheses
0033_Search_in_Rotated_Sorted_Array
0034_Find_First_and_Last_Position_of_Element_in_Sorted_Array
0035_Search_Insert_Position
0036_Valid_Sudoku
0037_Sudoku_Solver
0038_Count_and_Say
0039_Combination_Sum
0040_Combination_Sum_II
0041_First_Missing_Positive
0042_Trapping_Rain_Water
0043_Multiply_Strings
0044_Wildcard_Matching
0045_Jump_Game_II
0046_Permutations
0047_Permutations_II
0048_Rotate_Image
0049_Group_Anagrams
0050_Pow(x, n)
0051_N-Queens
0052_N-Queens_II
0053_Maximum_Subarray
0054_Spiral_Matrix
0055_Jump_Game
0056_Merge_Intervals
0057_Insert_Interval
0058_Length_of_Last_Word
0059_Spiral_Matrix_II
0060_Permutation_Sequence
0061_Rotate_List
0062_Unique_Paths
0063_Unique_Paths_II
0064_Minimum_Path_Sum
0065_Valid_Number
0066_Plus_One
0067_Add_Binary
0068_Text_Justification
0069_Sqrt(x)
0070_Climbing_Stairs
0071_Simplify_Path
0072_Edit_Distance
0073_Set_Matrix_Zeroes
0074_Search_a_2D_Matrix
0075_Sort_Colors
0076_Minimum_Window_Substring
0077_Combinations
0078_Subsets
0079_Word_Search
0080_Remove_Duplicates_from_Sorted_Array_II
0081_Search_in_Rotated_Sorted_Array_II
0082_Remove_Duplicates_from_Sorted_List_II
0083_Remove_Duplicates_from_Sorted_List
0084_Largest_Rectangle_in_Histogram
0085_Maximal_Rectangle
0086_Partition_List
0087_Scramble_String
0088_Merge_Sorted_Array
0090_Subsets_II
0091_Decode_Ways
0092_Reverse_Linked_List_II
0093_Restore_IP_Addresses
0094_Binary_Tree_Inorder_Traversal
0095_Unique_Binary_Search_Trees_II
0096_Unique_Binary_Search_Trees
0097_Interleaving_String
0098_Validate_Binary_Search_Tree
0099_Recover_Binary_Search_Tree
0100_Same_Tree
0101_Symmetric_Tree
0102_Binary_Tree_Level_Order_Traversal
0103_Binary_Tree_Zigzag_Level_Order_Traversal
0104_Maximum_Depth_of_Binary_Tree
0105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal
0106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal
0107_Binary_Tree_Level_Order_Traversal_II
0108_Convert_Sorted_Array_to_Binary_Search_Tree
0109_Convert_Sorted_List_to_Binary_Search_Tree
0110_Balanced_Binary_Tree
0111_Minimum_Depth_of_Binary_Tree
0112_Path_Sum
0113_Path_Sum_II
0114_Flatten_Binary_Tree_to_Linked_List
0115_Distinct_Subsequences
0116_Populating_Next_Right_Pointers_in_Each_Node
0117_Populating_Next_Right_Pointers_in_Each_Node_II
0118_Pascal's_Triangle
0119_Pascal's_Triangle_II
0120_Triangle
0121_Best_Time_to_Buy_and_Sell_Stock
0122_Best_Time_to_Buy_and_Sell_Stock_II
0123_Best_Time_to_Buy_and_Sell_Stock_III
0124_Binary_Tree_Maximum_Path_Sum
0125_Valid_Palindrome
0126_Word_Ladder_II
0127_Word_Ladder
0128_Longest_Consecutive_Sequence
0129_Sum_Root_to_Leaf_Numbers
0130_Surrounded_Regions
0132_Palindrome_Partitioning_II
0133_Clone_Graph
0134_Gas_Station
0135_Candy
0136_Single_Number
0137_Single_Number_II
0138_Copy_List_with_Random_Pointer
0139_Word_Break
0141_Linked_List_Cycle
0142_Linked_List_Cycle_II
0144_Binary_Tree_Preorder_Traversal
0145_Binary_Tree_Postorder_Traversal
0146_LRU_Cache
0147_Insertion_Sort_List
0148_Sort_List
0149_Max_Points_on_a_Line
0150_Evaluate_Reverse_Polish_Notation
0151_Reverse_Words_in_a_String
0152_Maximum_Product_Subarray
0153_Find_Minimum_in_Rotated_Sorted_Array
0154_Find_Minimum_in_Rotated_Sorted_Array_II
0155_Min_Stack
0157_Read_N_Characters_Given_Read4
0159_Longest_Substring_with_At_Most_Two_Distinct_Characters
0160_Intersection_of_Two_Linked_Lists
0162_Find_Peak_Element
0163_Missing_Ranges
0164_Maximum_Gap
0165_Compare_Version_Numbers
0166_Fraction_to_Recurring_Decimal
0167_Two_Sum_II_-_Input_array_is_sorted
0168_Excel_Sheet_Column_Title
0169_Majority_Element
0170_Two_Sum_III_-_Data_structure_design
0171_Excel_Sheet_Column_Number
0172_Factorial_Trailing_Zeroes
0173_Binary_Search_Tree_Iterator
0175_Combine_Two_Tables
0176_Second_Highest_Salary
0177_Nth_Highest_Salary
0178_Rank_Scores
0179_Largest_Number
0180_Consecutive_Numbers
0181_Employees_Earning_More_Than_Their_Managers
0182_Duplicate_Emails
0183_Customers_Who_Never_Order
0184_Department_Highest_Salary
0185_Department_Top_Three_Salaries
0187_Repeated_DNA_Sequences
0188_Best_Time_to_Buy_and_Sell_Stock_IV
0189_Rotate_Array
0190_Reverse_Bits
0191_Number_of_1_Bits
0196_Delete_Duplicate_Emails
0197_Rising_Temperature
0198_House_Robber
0199_Binary_Tree_Right_Side_View
0200_Number_of_Islands
0201_Bitwise_AND_of_Numbers_Range
0202_Happy_Number
0203_Remove_Linked_List_Elements
0204_Count_Primes
0205_Isomorphic_Strings
0206_Reverse_Linked_List
0207_Course_Schedule
0208_Implement_Trie_(Prefix_Tree)
0210_Course_Schedule_II
0211_Add_and_Search_Word_-_Data_structure_design
0213_House_Robber_II
0215_Kth_Largest_Element_in_an_Array
0217_Contains_Duplicate
0218_The_Skyline_Problem
0219_Contains_Duplicate_II
0220_Contains_Duplicate_III
0221_Maximal_Square
0222_Count_Complete_Tree_Nodes
0223_Rectangle_Area
0224_Basic_Calculator
0225_Implement_Stack_using_Queues
0226_Invert_Binary_Tree
0227_Basic_Calculator_II
0228_Summary_Ranges
0229_Majority_Element_II
0231_Power_of_Two
0232_Implement_Queue_using_Stacks
0233_Number_of_Digit_One
0234_Palindrome_Linked_List
0235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree
0236_Lowest_Common_Ancestor_of_a_Binary_Tree
0237_Delete_Node_in_a_Linked_List
0239_Sliding_Window_Maximum
0240_Search_a_2D_Matrix_II
0242_Valid_Anagram
0243_Shortest_Word_Distance
0244_Shortest_Word_Distance_II
0246_Strobogrammatic_Number
0251_Flatten_2D_Vector
0252_Meeting_Rooms
0253_Meeting_Rooms_II
0256_Paint_House
0257_Binary_Tree_Paths
0258_Add_Digits
0260_Single_Number_III
0261_Graph_Valid_Tree
0262_Trips_and_Users
0263_Ugly_Number
0264_Ugly_Number_II
0266_Palindrome_Permutation
0268_Missing_Number
0270_Closest_Binary_Search_Tree_Value
0273_Integer_to_English_Words
0274_H-Index
0276_Paint_Fence
0279_Perfect_Squares
0283_Move_Zeroes
0289_Game_of_Life
0290_Word_Pattern
0293_Flip_Game
0295_Find_Median_from_Data_Stream
0299_Bulls_and_Cows
0300_Longest_Increasing_Subsequence
0301_Remove_Invalid_Parentheses
0303_Range_Sum_Query_-_Immutable
0304_Range_Sum_Query_2D_-_Immutable
0309_Best_Time_to_Buy_and_Sell_Stock_with_Cooldown
0310_Minimum_Height_Trees
0313_Super_Ugly_Number
0318_Maximum_Product_of_Word_Lengths
0319_Bulb_Switcher
0321_Create_Maximum_Number
0322_Coin_Change
0323_Number_of_Connected_Components_in_an_Undirected_Graph
0326_Power_of_Three
0328_Odd_Even_Linked_List
0331_Verify_Preorder_Serialization_of_a_Binary_Tree
0332_Reconstruct_Itinerary
0335_Self_Crossing
0338_Counting_Bits
0340_Longest_Substring_with_At_Most_K_Distinct_Characters
0341_Flatten_Nested_List_Iterator
0342_Power_of_Four
0343_Integer_Break
0344_Reverse_String
0345_Reverse_Vowels_of_a_String
0347_Top_K_Frequent_Elements
0349_Intersection_of_Two_Arrays
0350_Intersection_of_Two_Arrays_II
0352_Data_Stream_as_Disjoint_Intervals
0354_Russian_Doll_Envelopes
0355_Design_Twitter
0359_Logger_Rate_Limiter
0367_Valid_Perfect_Square
0371_Sum_of_Two_Integers
0373_Find_K_Pairs_with_Smallest_Sums
0375_Guess_Number_Higher_or_Lower_II
0376_Wiggle_Subsequence
0378_Kth_Smallest_Element_in_a_Sorted_Matrix
0381_Insert_Delete_GetRandom_O(1)_-_Duplicates_allowed
0382_Linked_List_Random_Node
0383_Ransom_Note
0384_Shuffle_an_Array
0387_First_Unique_Character_in_a_String
0389_Find_the_Difference
0391_Perfect_Rectangle
0392_Is_Subsequence
0395_Longest_Substring_with_At_Least_K_Repeating_Characters
0397_Integer_Replacement
0399_Evaluate_Division
0401_Binary_Watch
0402_Remove_K_Digits
0403_Frog_Jump
0404_Sum_of_Left_Leaves
0406_Queue_Reconstruction_by_Height
0407_Trapping_Rain_Water_II
0408_Valid_Word_Abbreviation
0412_Fizz_Buzz
0413_Arithmetic_Slices
0415_Add_Strings
0416_Partition_Equal_Subset_Sum
0421_Maximum_XOR_of_Two_Numbers_in_an_Array
0424_Longest_Repeating_Character_Replacement
0434_Number_of_Segments_in_a_String
0435_Non-overlapping_Intervals
0437_Path_Sum_III
0441_Arranging_Coins
0443_String_Compression
0444_Sequence_Reconstruction
0445_Add_Two_Numbers_II
0446_Arithmetic_Slices_II_-_Subsequence
0447_Number_of_Boomerangs
0448_Find_All_Numbers_Disappeared_in_an_Array
0450_Delete_Node_in_a_BST
0451_Sort_Characters_By_Frequency
0452_Minimum_Number_of_Arrows_to_Burst_Balloons
0453_Minimum_Moves_to_Equal_Array_Elements
0454_4Sum_II
0455_Assign_Cookies
0456_132_Pattern
0458_Poor_Pigs
0459_Repeated_Substring_Pattern
0460_LFU_Cache
0461_Hamming_Distance
0463_Island_Perimeter
0474_Ones_and_Zeroes
0476_Number_Complement
0477_Total_Hamming_Distance
0480_Sliding_Window_Median
0483_Smallest_Good_Base
0485_Max_Consecutive_Ones
0488_Zuma_Game
0492_Construct_the_Rectangle
0493_Reverse_Pairs
0494_Target_Sum
0495_Teemo_Attacking
0496_Next_Greater_Element_I
0501_Find_Mode_in_Binary_Search_Tree
0502_IPO
0503_Next_Greater_Element_II
0504_Base_7
0506_Relative_Ranks
0509_Fibonacci_Number
0511_Game_Play_Analysis_I
0512_Game_Play_Analysis_II
0513_Find_Bottom_Left_Tree_Value
0514_Freedom_Trail
0516_Longest_Palindromic_Subsequence
0518_Coin_Change_2
0520_Detect_Capital
0521_Longest_Uncommon_Subsequence_I
0523_Continuous_Subarray_Sum
0524_Longest_Word_in_Dictionary_through_Deleting
0525_Contiguous_Array
0526_Beautiful_Arrangement
0528_Random_Pick_with_Weight
0530_Minimum_Absolute_Difference_in_BST
0534_Game_Play_Analysis_III
0538_Convert_BST_to_Greater_Tree
0540_Single_Element_in_a_Sorted_Array
0541_Reverse_String_II
0542_01_Matrix
0543_Diameter_of_Binary_Tree
0547_Number_of_Provinces
0550_Game_Play_Analysis_IV
0551_Student_Attendance_Record_I
0552_Student_Attendance_Record_II
0556_Next_Greater_Element_III
0559_Maximum_Depth_of_N-ary_Tree
0560_Subarray_Sum_Equals_K
0561_Array_Partition_I
0563_Binary_Tree_Tilt
0566_Reshape_the_Matrix
0567_Permutation_in_String
0570_Managers_with_at_Least_5_Direct_Reports
0572_Subtree_of_Another_Tree
0574_Winning_Candidate
0575_Distribute_Candies
0577_Employee_Bonus
0578_Get_Highest_Answer_Rate_Question
0580_Count_Student_Number_in_Departments
0581_Shortest_Unsorted_Continuous_Subarray
0583_Delete_Operation_for_Two_Strings
0584_Find_Customer_Referee
0585_Investments_in_2016
0586_Customer_Placing_the_Largest_Number_of_Orders
0595_Big_Countries
0596_Classes_More_Than_5_Students
0597_Friend_Requests_I:_Overall_Acceptance_Rate
0602_Friend_Requests_II:_Who_Has_the_Most_Friends
0603_Consecutive_Available_Seats
0605_Can_Place_Flowers
0607_Sales_Person
0608_Tree_Node
0610_Triangle_Judgement
0611_Valid_Triangle_Number
0612_Shortest_Distance_in_a_Plane
0613_Shortest_Distance_in_a_Line
0614_Second_Degree_Follower
0617_Merge_Two_Binary_Trees
0619_Biggest_Single_Number
0620_Not_Boring_Movies
0626_Exchange_Seats
0627_Swap_Salary
0629_K_Inverse_Pairs_Array
0633_Sum_of_Square_Numbers
0637_Average_of_Levels_in_Binary_Tree
0639_Decode_Ways_II
0643_Maximum_Average_Subarray_I
0646_Maximum_Length_of_Pair_Chain
0649_Dota2_Senate
0650_2_Keys_Keyboard
0653_Two_Sum_IV_-_Input_is_a_BST
0659_Split_Array_into_Consecutive_Subsequences
0661_Image_Smoother
0664_Strange_Printer
0665_Non-decreasing_Array
0669_Trim_a_Binary_Search_Tree
0671_Second_Minimum_Node_In_a_Binary_Tree
0680_Valid_Palindrome_II
0684_Redundant_Connection
0692_Top_K_Frequent_Words
0697_Degree_of_an_Array
0703_Kth_Largest_Element_in_a_Stream
- 思路1 优先队列
0704_Binary_Search
0714_Best_Time_to_Buy_and_Sell_Stock_with_Transaction_Fee
0724_Find_Pivot_Index
0725_Split_Linked_List_in_Parts
0726_Number_of_Atoms
0738_Monotone_Increasing_Digits
0740_Delete_and_Earn
0743_Network_Delay_Time
0746_Min_Cost_Climbing_Stairs
0765_Couples_Holding_Hands
0766_Toeplitz_Matrix
0767_Reorganize_String
0783_Minimum_Distance_Between_BST_Nodes
0785_Is_Graph_Bipartite?
0786_K-th_Smallest_Prime_Fraction
0787_Cheapest_Flights_Within_K_Stops
0789_Escape_The_Ghosts
0797_All_Paths_From_Source_to_Target
0802_Find_Eventual_Safe_States
0815_Bus_Routes
0820_Short_Encoding_of_Words
0830_Positions_of_Large_Groups
0832_Flipping_an_Image
0842_Split_Array_into_Fibonacci_Sequence
0847_Shortest_Path_Visiting_All_Nodes
0852_Peak_Index_in_a_Mountain_Array
0859_Buddy_Strings
0860_Lemonade_Change
0861_Score_After_Flipping_Matrix
0863_All_Nodes_Distance_K_in_Binary_Tree
0867_Transpose_Matrix
0869_Reordered_Power_of_2
0872_Leaf-Similar_Trees
0876_Middle_of_the_Linked_List
0877_Stone_Game
0879_Profitable_Schemes
0881_Boats_to_Save_People
0882_Reachable_Nodes_In_Subdivided_Graph
0887_Super_Egg_Drop
0888_Fair_Candy_Swap
0889_Construct_Binary_Tree_from_Preorder_and_Postorder_Traversal
0892_Surface_Area_of_3D_Shapes
0897_Increasing_Order_Search_Tree
0912_Sort_an_Array
0914_X_of_a_Kind_in_a_Deck_of_Cards
0922_Sort_Array_By_Parity_II
0930_Binary_Subarrays_With_Sum
0938_Range_Sum_of_BST
0941_Valid_Mountain_Array
0945_Minimum_Increment_to_Make_Array_Unique
0959_Regions_Cut_By_Slashes
0973_K_Closest_Points_to_Origin
0976_Largest_Perimeter_Triangle
0978_Longest_Turbulent_Subarray
0981_Time_Based_Key-Value_Store
0993_Cousins_in_Binary_Tree
0995_Minimum_Number_of_K_Consecutive_Bit_Flips
0999_Available_Captures_for_Rook
1004_Max_Consecutive_Ones_III
1005_Maximize_Sum_Of_Array_After_K_Negations
1006_Clumsy_Factorial
1011_Capacity_To_Ship_Packages_Within_D_Days
1025_Divisor_Game
1030_Matrix_Cells_in_Distance_Order
1035_Uncrossed_Lines
1045_Customers_Who_Bought_All_Products
1046_Last_Stone_Weight
1049_Last_Stone_Weight_II
1050_Actors_and_Directors_Who_Cooperated_At_Least_Three_Times
1052_Grumpy_Bookstore_Owner
1059_All_Paths_from_Source_Lead_to_Destination
1068_Product_Sales_Analysis_I
1069_Product_Sales_Analysis_II
1070_Product_Sales_Analysis_III
1074_Number_of_Submatrices_That_Sum_to_Target
1075_Project_Employees_I
1076_Project_Employees_II
1077_Project_Employees_III
1082_Sales_Analysis_I
1083_Sales_Analysis_II
1084_Sales_Analysis_III
1098_Unpopular_Books
1104_Path_In_Zigzag_Labelled_Binary_Tree
1107_New_Users_Daily_Count
1109_Corporate_Flight_Bookings
1110_Delete_Nodes_And_Return_Forest
1111_Maximum_Nesting_Depth_of_Two_Valid_Parentheses_Strings
1112_Highest_Grade_For_Each_Student
1113_Reported_Posts
1122_Relative_Sort_Array
1126_Active_Businesses
1128_Number_of_Equivalent_Domino_Pairs
1132_Reported_Posts_II
1135_Connecting_Cities_With_Minimum_Cost
1141_User_Activity_for_the_Past_30_Days_I
1142_User_Activity_for_the_Past_30_Days_II
1143_Longest_Common_Subsequence
1148_Article_Views_I
1162_As_Far_from_Land_as_Possible
1173_Immediate_Food_Delivery_I
1178_Number_of_Valid_Words_for_Each_Puzzle
1179_Reformat_Department_Table
1190_Reverse_Substrings_Between_Each_Pair_of_Parentheses
1202_Smallest_String_With_Swaps
1203_Sort_Items_by_Groups_Respecting_Dependencies
1207_Unique_Number_of_Occurrences
1208_Get_Equal_Substrings_Within_Budget
1211_Queries_Quality_and_Percentage
1218_Longest_Arithmetic_Subsequence_of_Given_Difference
1221_Split_a_String_in_Balanced_Strings
1232_Check_If_It_Is_a_Straight_Line
1241_Number_of_Comments_per_Post
1251_Average_Selling_Price
1269_Number_of_Ways_to_Stay_in_the_Same_Place_After_Some_Steps
1280_Students_and_Examinations
1294_Weather_Type_in_Each_Country
1303_Find_the_Team_Size
1310_XOR_Queries_of_a_Subarray
1322_Ads_Performance
1327_List_the_Products_Ordered_in_a_Period
1350_Students_With_Invalid_Departments
1370_Increasing_Decreasing_String
1378_Replace Employee_ID_With_The_Unique_Identifier
1418_Display_Table_of_Food_Orders_in_a_Restaurant
1438_Longest_Continuous_Subarray_With_Absolute_Diff_Less_Than_or_Equal_to_Limit
1442_Count_Triplets_That_Can_Form_Two_Arrays_of_Equal_XOR
1486_XOR_Operation_in_an_Array
1579_Remove_Max_Number_of_Edges_to_Keep_Graph_Fully_Traversable
1600_Throne_Inheritance
1603_Design_Parking_System
1631_Path_With_Minimum_Effort
1646_Get_Maximum_in_Generated_Array
1711_Count_Good_Meals
1720_Decode_XORed_Array
1721_Swapping_Nodes_in_a_Linked_List
1722_Minimize_Hamming_Distance_After_Swap_Operations
1723_Find_Minimum_Time_to_Finish_All_Jobs
1734_Decode_XORed_Permutation
1738_Find_Kth_Largest_XOR_Coordinate_Value
1744_Can_You_Eat_Your_Favorite_Candy_on_Your_Favorite_Day?
1746_Maximum_Subarray_Sum_After_One_Operation
1770_Maximum_Score_from_Performing_Multiplication_Operations
1787_Make_the_XOR_of_All_Segments_Equal_to_Zero
1833_Maximum_Ice_Cream_Bars
1838_Frequency_of_the_Most_Frequent_Element
1846_Maximum_Element_After_Decreasing_and_Rearranging
1877_Minimize_Maximum_Pair_Sum_in_Array
1893_Check_if_All_the_Integers_in_a_Range_Are_Covered
1894_Find_the_Student_that_Will_Replace_the_Chalk
mst01.07_Rotate_Matrix_LCCI
mst02.05_Sum_Lists_LCCI
mst10.01_Sorted_Merge_LCCI
mst16.15_Master_Mind_LCCI
mst16.16_Sub_Sort_LCCI
mst16.17_Contiguous_Sequence_LCCI
mst16.20_T9_LCCI
mst16.21_Sum_Swap_LCCI
mst16.22_Langtons_Ant_LCCI
mst16.24_Pairs_With_Sum_LCCI
mst17.04_Missing_Number_LCCI
mst17.14_Smallest_K_LCCI
mst17.16_The_Masseuse_LCCI
mst17.21_Volume_of_Histogram_LCCI

Powered by GitBook

On this page

0703_Kth_Largest_Element_in_a_Stream

思路1 优先队列

PreviousSolution1 Hash Next思路1 优先队列

Was this helpful?

Was this helpful?