1252 Cells with Odd Values in a Matrix 78.50% Easy 1251 Average Selling Price *$ 83.20% Easy 1250 Check If It Is a Good Array 57.50% Hard 1249 Minimum Remove to Make Valid Parentheses 65.00% Medium 1248 Count Number of Nice Subarrays 57.60% Medium 1247 Minimum Swaps to Make Strings Equal...
311 Sparse Matrix Multiplication $ 40.00% Medium 310 Minimum Height Trees 20.20% Medium 309 Best Time to Buy and Sell Stock with Cooldown 32.60% Medium 308 Range Sum Query 2D - Mutable $ 20.30% Hard 307 Range Sum Query - Mutable 14.50% Medium 306 Additive Number 23.30% Medium 305 Number ...
668.Kth-Smallest-Number-in-Multiplication-Table (H-) 719.Find-Kth-Smallest-Pair-Distance (H-) 1918.Kth-Smallest-Subarray-Sum (M+) 2040.Kth-Smallest-Product-of-Two-Sorted-Arrays (H-) 1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows (H) 786.Kth-Smallest-Prime-Fraction (H-...
542 01 Matrix 32.50% Medium 541 Reverse String II 44.40% Easy 540 Single Element in a Sorted Array 55.90% Medium 539 Minimum Time Difference 44.70% Medium 538 Convert BST to Greater Tree 52.70% Medium 537 Complex Number Multiplication 65.90% Medium 536 Construct Binary Tree from String $ 36.30...
311 Sparse Matrix Multiplication Solution O(mnl) O(m*l) Medium 312 Burst Balloons Solution O(?) O(?) Hard DP 313 Super Ugly Number Solution O(?) O(?) Medium 314 Binary Tree Vertical Order Traversal Solution O(n) O(n) Medium HashMap, BFS 315 Count of Smaller Numbers After Self ...
311 Sparse Matrix Multiplication $ 40.00% Medium 312 Burst Balloons 24.50% Medium 313 Super Ugly Number 31.20% Medium 314 Binary Tree Vertical Order Traversal $ 30.10% Medium 315 Count of Smaller Numbers After Self 28.20% Hard 316 Remove Duplicate Letters 23.00% Medium 317 Shortest Distance from ...
DP思想 之 Matrix-chain multiplication(矩阵链相乘问题) 一.矩阵链复杂度计算(根据两两相乘计算次数): 假设有A1(10*100),A2(100*5),A3(5*50)三个矩阵 ((A1A2)A3) 计算顺序使用到的乘法次数为:10*100*5 + 10*5*50=7500次 (A1(A2A3)) 计算顺序使用到的乘法次数为:100*5*50 + 10*100*50=...
542 01 Matrix Algorithms Medium 541 Reverse String II Algorithms Easy 540 Single Element in a Sorted Array Draft Medium 539 Minimum Time Difference Algorithms Medium 538 Convert BST to Greater Tree Algorithms Easy 537 Complex Number Multiplication Algorithms Medium 536 Construct Binary Tree from String...
矩阵链乘法(Matrix Chain Multiplication) 贪心算法(Greedy Algorithms) 背包问题(有时贪心可行,有时需要DP) 活动安排问题(Activity Selection Problem) 最小生成树(Minimum Spanning Tree,Prim算法和Kruskal算法) 分治算法(Divide and Conquer) 大整数乘法 二叉树的深度优先搜索(DFS)和广度优先搜索(BFS) Strassen矩阵乘法...
784. Complex Number Multiplication Medium 复数运算,重点是分割字符串 /fuxuemingzhu/article/details/79266080 785. Counting Bits Medium i的二进制1个数等于i/2的二进制个数+i%2 /fuxuemingzhu/article/details/70806676 786. Spiral Matrix III Medium 保留循环更新步数,很恶心 /fuxuemingzhu/article/details/8238...