Description A peak element is an element that is greater than its neighbors. Given an i...
發簡信
IP屬地：賓夕法尼亞州
-
[Med] 162. Find Peak Element
-
[BST Medium] 865 Smallest Subtree with all the Deepest Nodes
Description Given a binary tree rooted at root, the depth of each node is the shortest ...
-
[Hard BFS] Word Ladders
Description 給出兩個單詞（start和end）和一個字典，找出從start到end的最短轉換序列，輸出最短序列的長度。 變換規則如下： 每次只能改變一個字母。變換...
-
[Easy] 680. Valid Palindrome II
Description Given a non-empty string s, you may delete at most one character. Judge whe...
-
[Med ]621. Task Scheduler
Description 給定一個字符串，表示CPU需要執行的任務。 這個字符串由大寫字母A到Z構成，不同的字母代表不同的任務。完成任務不需要按照給定的順序。 每項任務都可以在...
-
161. One Edit Distance
Description Given two strings s and t, determine if they are both one edit distance apa...
-
[Med] 560. Subarray Sum Equals K
Description Given an array of integers and an integer k, you need to find the total num...
-
[Med 2ptr]986. Interval List Intersections
Description 給定兩個interval序列，輸出所有intersection interval Solution T O(N)
-
655. Print Binary Tree
Description Print a binary tree in an m*n 2D string array following these rules: The ro...
-
[Med] 670. Maximum Swap
Description Given a non-negative integer, you could swap two digits at most once to get...
-
[Easy 2ptr] 88. Merge Sorted Array
Description Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as ...
-
[Hard heap] 23. Merge k Sorted Lists
Description Merge k sorted linked lists and return it as one sorted list. Analyze and d...
-
[Hard DFS] 301. Remove Invalid Parentheses
如果只需要找一個存在的解：（使用棧即可）O(N^2) Description Remove the minimum number of invalid parentheses...
-
[Med Biptr] 560. Subarray Sum Equals K
Description Given an array of integers and an integer k, you need to find the total num...
-
Clone Graph
Description Clone an undirected graph. Each node in the graph contains a label and a li...
-
240. Search a 2D Matrix II
Description Write an efficient algorithm that searches for a value in an m x n matrix. ...
-
[Med Bi-Div] 33. Search in Rotated Sorted Array
Description Suppose an array sorted in ascending order is rotated at some pivot unknown...