矩阵链乘法(Matrix Chain Multiplication) 贪心算法(Greedy Algorithms) 背包问题(有时贪心可行,有时需要DP) 活动安排问题(Activity Selection Problem) 最小生成树(Minimum Spanning Tree,Prim算法和Kruskal算法) 分治算法(Divide and Conquer) 大整数乘法 二叉树的深度优先搜索(DFS)和广度优先搜索(BFS) Strassen矩阵乘法...
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=...
54https://leetcode.com/problems/spiral-matrix/ 打印旋转矩阵。 223https://leetcode.com/problems/rectangle-area/ 计算矩形面积。 228https://leetcode.com/problems/summary-ranges/ 连续数字打印成特定格式。 537https://leetcode.com/problems/complex-number-multiplication/ 计算复数相加。 885https://leetco...
kth-smallest-element-in-a-sorted-matrix lMSNwu largest-3-same-digit-number-in-string largest-component-size-by-common-factor largest-local-values-in-a-matrix largest-merge-of-two-strings largest-number largest-odd-number-in-string largest-plus-sign largest-positive-integer-that-exist...
LeetCode378https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/ LeetCode410https://leetcode.com/problems/split-array-largest-sum/ LeetCode668https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/ LeetCode719https://leetcode.com/problems/find-k-th-smallest-...
Can you solve this real interview question? Burst Balloons - You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represented by an array nums. You are asked to burst all the balloons. If you burst the ith ballo
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...
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...
0537 Complex Number Multiplication Go 67.4% Medium 0538 Convert BST to Greater Tree 55.3% Easy 0539 Minimum Time Difference 51.5% Medium 0540 Single Element in a Sorted Array 57.9% Medium 0541 Reverse String II Go 48.4% Easy 0542 01 Matrix Go 39.8% Medium 0543 Diameter of Binary Tre...
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...