Space Complexity: O(log n) for the recursive call stack. The merge sort algorithm uses recursion to sort the left and right halves, and the maximum depth of the recursion stack is proportional to the height of the linked list, which is O(log n) for a balanced list. Other Similar Leet...
三刷使用Dijkstra算法,效率不如BFS,按理说不应该这样,还可以可以继续改进,因为BFS是Dijkstra的降级。 原来leetcode后端是用python写的!以后用pycharm写python或者intelij idea写java来debug也不错! dfs_wa BFS dijkstra 542. 01 Matrix https://leetcode.com/problems/01-matrix/description/ View Code 一刷使用朴素...
This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The problems attempted multiple times are labelled with hyperlinks.
N/A Binary Tree Longest Consecutive Sequence II.java Medium [DFS, Divide and Conquer, Double Recursive, Tree] Java 44 N/A Minimum Subarray.java Easy [Array, DP, Greedy, Sequence DP, Subarray] O(m) O(1) Java 45 N/A Connecting Graph.java Medium [Union Find] Java 46 N/A Count of ...
Can you solve this real interview question? Letter Combinations of a Phone Number - Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. A mapping o
285 Path Sum III.java Easy Java [DFS, Double Recursive, Tree] 286 Rotate String.java Easy Java [String] 287 Combinations.java Medium Java [Backtracking, Combination, DFS] 288 Combination Sum IV.java Medium Java [Array, Backpack DP, DP] 289 Binary Tree Right Side View.java Medium Jav...
285 Path Sum III.java Easy Java [DFS, Double Recursive, Tree] 286 Rotate String.java Easy Java [String] 287 Combinations.java Medium Java [Backtracking, Combination, DFS] 288 Combination Sum IV.java Medium Java [Array, Backpack DP, DP] 289 Binary Tree Right Side View.java Medium Jav...
285 Path Sum III.java Easy Java [DFS, Double Recursive, Tree] 286 Rotate String.java Easy Java [String] 287 Combinations.java Medium Java [Backtracking, Combination, DFS] 288 Combination Sum IV.java Medium Java [Array, Backpack DP, DP] 289 Binary Tree Right Side View.java Medium Jav...
285 Path Sum III.java Easy Java [DFS, Double Recursive, Tree] 286 Rotate String.java Easy Java [String] 287 Combinations.java Medium Java [Backtracking, Combination, DFS] 288 Combination Sum IV.java Medium Java [Array, Backpack DP, DP] 289 Binary Tree Right Side View.java Medium Jav...
285 Path Sum III.java Easy Java [DFS, Double Recursive, Tree] 286 Rotate String.java Easy Java [String] 287 Combinations.java Medium Java [Backtracking, Combination, DFS] 288 Combination Sum IV.java Medium Java [Array, Backpack DP, DP] 289 Binary Tree Right Side View.java Medium Jav...