🌃
Limited Algorithm
Ctrlk
  • Summary
  • Hash & TreeMap
  • Queue &Stack & PQ
  • Hybrid Data Structure
  • Graph
    • Summary
    • 基本功&母体 skip
    • Graph Theory II& III Problem of Connectivity and Reachable
    • Graph Theory IV& V:  Shortest Path: BFS
    • Graph Theory VI: Shortest Path III Dijkstra Algorithm
      • Dijkstra Algorithm基本过程与理解
      • Question 1 Shortest Time to Office Mr Gao
      • Question 2: Maximum Cost of Trip With K HighWays
      • Question 3 Kth Smallest with Only 3, 5, 7 As Factors
      • Question 4 K th Clostest Point to <0,0,0>
      • Question 5 Kth Smallest Number in Sorted Matrix
      • Problem 6 Trapping Rain Water II
      • Question 7 Trapping Rain Water 1
      • Question Extra Minimum cost to reach city with discounts
    • Graph Theory VIII Topological Order
    • Graph Theory IX Introduction to Disjoint Set(Union Find)
    • Graph Theory X: Union Find More Ractcce on UF
    • Graph Theory XI: UF 拓展 && Minimum Spanning Tree I & II
  • Graph Backtracking and Others
  • Tree
  • Pure Recursion & Backtracking
  • Dynamic Programming
  • Others
  • Array& LinkedList & String
  • Adavance Two Pointer
  • Advance Sliding Window
  • Advance Binary Search
  • Advance Young's Matrix
  • Java Knowledge
Powered by GitBook
On this page
  1. Graph
  2. Graph Theory VI: Shortest Path III Dijkstra Algorithm

Question 5 Kth Smallest Number in Sorted Matrix

PreviousQuestion 4 K th Clostest Point to <0,0,0>NextProblem 6 Trapping Rain Water II