From fbf51f35ec87d350881d6a992b86f35b27117a95 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Wed, 11 Aug 2021 16:33:57 +0800
Subject: [PATCH] =?UTF-8?q?378:=E6=9C=89=E5=BA=8F=E7=9F=A9=E9=98=B5?=
 =?UTF-8?q?=E4=B8=AD=E7=AC=AC=20K=20=E5=B0=8F=E7=9A=84=E5=85=83=E7=B4=A0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../cn/KthSmallestElementInASortedMatrix.java | 92 +++++++++++++++++++
 .../cn/KthSmallestElementInASortedMatrix.md   | 33 +++++++
 2 files changed, 125 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/KthSmallestElementInASortedMatrix.java
 create mode 100644 src/main/java/leetcode/editor/cn/KthSmallestElementInASortedMatrix.md

diff --git a/src/main/java/leetcode/editor/cn/KthSmallestElementInASortedMatrix.java b/src/main/java/leetcode/editor/cn/KthSmallestElementInASortedMatrix.java
new file mode 100644
index 0000000..ef2c9cd
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/KthSmallestElementInASortedMatrix.java
@@ -0,0 +1,92 @@
+//给你一个 n x n 矩阵 matrix ，其中每行和每列元素均按升序排序，找到矩阵中第 k 小的元素。 
+//请注意，它是 排序后 的第 k 小元素，而不是第 k 个 不同 的元素。 
+//
+// 
+//
+// 示例 1： 
+//
+// 
+//输入：matrix = [[1,5,9],[10,11,13],[12,13,15]], k = 8
+//输出：13
+//解释：矩阵中的元素为 [1,5,9,10,11,12,13,13,15]，第 8 小元素是 13
+// 
+//
+// 示例 2： 
+//
+// 
+//输入：matrix = [[-5]], k = 1
+//输出：-5
+// 
+//
+// 
+//
+// 提示： 
+//
+// 
+// n == matrix.length 
+// n == matrix[i].length 
+// 1 <= n <= 300 
+// -109 <= matrix[i][j] <= 109 
+// 题目数据 保证 matrix 中的所有行和列都按 非递减顺序 排列 
+// 1 <= k <= n2 
+// 
+// Related Topics 数组 二分查找 矩阵 排序 堆（优先队列） 
+// 👍 639 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.TwoArray;
+
+import java.util.Arrays;
+import java.util.Comparator;
+import java.util.PriorityQueue;
+import java.util.Queue;
+
+//378:有序矩阵中第 K 小的元素
+class KthSmallestElementInASortedMatrix {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new KthSmallestElementInASortedMatrix().new Solution();
+        TwoArray twoArray = new TwoArray("[[1,3,5],[6,7,12],[11,14,14]]", true);
+        System.out.println(solution.kthSmallest(twoArray.getArr(), 6));
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public int kthSmallest(int[][] matrix, int k) {
+//            Queue<int[]> queue = new PriorityQueue<>(Comparator.comparingInt(o -> o[2]));
+//            queue.add(new int[]{0, 0, matrix[0][0]});
+//            boolean[][] use = new boolean[matrix.length][matrix[0].length];
+//            use[0][0] = true;
+//            while (!queue.isEmpty()) {
+//                k--;
+//                int[] arr = queue.poll();
+//                if (k == 0) {
+//                    return arr[2];
+//                }
+//                if (arr[0] + 1 < matrix.length && !use[arr[0] + 1][arr[1]]) {
+//                    queue.add(new int[]{arr[0] + 1, arr[1], matrix[arr[0] + 1][arr[1]]});
+//                    use[arr[0] + 1][arr[1]] = true;
+//                }
+//                if (arr[1] + 1 < matrix[0].length && !use[arr[0]][arr[1] + 1]) {
+//                    queue.add(new int[]{arr[0], arr[1] + 1, matrix[arr[0]][arr[1] + 1]});
+//                    use[arr[0]][arr[1] + 1] = true;
+//                }
+//            }
+//            return 0;
+            int rows = matrix.length, columns = matrix[0].length;
+            int[] sorted = new int[rows * columns];
+            int index = 0;
+            for (int[] row : matrix) {
+                for (int num : row) {
+                    sorted[index++] = num;
+                }
+            }
+            Arrays.sort(sorted);
+            return sorted[k - 1];
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/KthSmallestElementInASortedMatrix.md b/src/main/java/leetcode/editor/cn/KthSmallestElementInASortedMatrix.md
new file mode 100644
index 0000000..e149556
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/KthSmallestElementInASortedMatrix.md
@@ -0,0 +1,33 @@
+<p>给你一个 <code>n x n</code><em> </em>矩阵 <code>matrix</code> ，其中每行和每列元素均按升序排序，找到矩阵中第 <code>k</code> 小的元素。<br />
+请注意，它是 <strong>排序后</strong> 的第 <code>k</code> 小元素，而不是第 <code>k</code> 个 <strong>不同</strong> 的元素。</p>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>matrix = [[1,5,9],[10,11,13],[12,13,15]], k = 8
+<strong>输出：</strong>13
+<strong>解释：</strong>矩阵中的元素为 [1,5,9,10,11,12,13,<strong>13</strong>,15]，第 8 小元素是 13
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>matrix = [[-5]], k = 1
+<strong>输出：</strong>-5
+</pre>
+
+<p> </p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>n == matrix.length</code></li>
+	<li><code>n == matrix[i].length</code></li>
+	<li><code>1 <= n <= 300</code></li>
+	<li><code>-10<sup>9</sup> <= matrix[i][j] <= 10<sup>9</sup></code></li>
+	<li>题目数据 <strong>保证</strong> <code>matrix</code> 中的所有行和列都按 <strong>非递减顺序</strong> 排列</li>
+	<li><code>1 <= k <= n<sup>2</sup></code></li>
+</ul>
+<div><div>Related Topics</div><div><li>数组</li><li>二分查找</li><li>矩阵</li><li>排序</li><li>堆（优先队列）</li></div></div>\n<div><li>👍 639</li><li>👎 0</li></div>
\ No newline at end of file