mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
41 lines
1.5 KiB
HTML
41 lines
1.5 KiB
HTML
<p>You are given a 2D <code>matrix</code> of size <code>m x n</code>, consisting of non-negative integers. You are also given an integer <code>k</code>.</p>
|
|
|
|
<p>The <strong>value</strong> of coordinate <code>(a, b)</code> of the matrix is the XOR of all <code>matrix[i][j]</code> where <code>0 <= i <= a < m</code> and <code>0 <= j <= b < n</code> <strong>(0-indexed)</strong>.</p>
|
|
|
|
<p>Find the <code>k<sup>th</sup></code> largest value <strong>(1-indexed)</strong> of all the coordinates of <code>matrix</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> matrix = [[5,2],[1,6]], k = 1
|
|
<strong>Output:</strong> 7
|
|
<strong>Explanation:</strong> The value of coordinate (0,1) is 5 XOR 2 = 7, which is the largest value.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> matrix = [[5,2],[1,6]], k = 2
|
|
<strong>Output:</strong> 5
|
|
<strong>Explanation:</strong> The value of coordinate (0,0) is 5 = 5, which is the 2nd largest value.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> matrix = [[5,2],[1,6]], k = 3
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong> The value of coordinate (1,0) is 5 XOR 1 = 4, which is the 3rd largest value.</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>m == matrix.length</code></li>
|
|
<li><code>n == matrix[i].length</code></li>
|
|
<li><code>1 <= m, n <= 1000</code></li>
|
|
<li><code>0 <= matrix[i][j] <= 10<sup>6</sup></code></li>
|
|
<li><code>1 <= k <= m * n</code></li>
|
|
</ul>
|