coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 19:31:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-02-22 16:46:22 +08:00
parent b9720f7ac1
commit 1627cd9a3b
44 changed files with 22275 additions and 16782 deletions
Download Patch File Download Diff File Expand all files Collapse all files

70
leetcode-cn/problem (Chinese)/按对角线进行矩阵排序 [sort-matrix-by-diagonals].html Normal file
View File

@@ -0,0 +1,70 @@
<p>给你一个大小为&nbsp;<code>n x n</code> 的整数方阵 <code>grid</code>。返回一个经过如下调整的矩阵：</p>
<ul>
<li><strong>左下角三角形</strong>（包括中间对角线）的对角线按&nbsp;<strong>非递增顺序&nbsp;</strong>排序。</li>
<li><strong>右上角三角形&nbsp;</strong>的对角线按&nbsp;<strong>非递减顺序&nbsp;</strong>排序。</li>
</ul>
<p>&nbsp;</p>
<p><strong class="example">示例 1：</strong></p>
<div class="example-block">
<p><strong>输入：</strong> <span class="example-io">grid = [[1,7,3],[9,8,2],[4,5,6]]</span></p>
<p><strong>输出：</strong> <span class="example-io">[[8,2,3],[9,6,7],[4,5,1]]</span></p>
<p><strong>解释：</strong></p>
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/12/29/4052example1drawio.png" style="width: 461px; height: 181px;" /></p>
<p>标有黑色箭头的对角线（左下角三角形）应按非递增顺序排序：</p>
<ul>
<li><code>[1, 8, 6]</code> 变为 <code>[8, 6, 1]</code>。</li>
<li><code>[9, 5]</code> 和 <code>[4]</code> 保持不变。</li>
</ul>
<p>标有蓝色箭头的对角线（右上角三角形）应按非递减顺序排序：</p>
<ul>
<li><code>[7, 2]</code> 变为 <code>[2, 7]</code>。</li>
<li><code>[3]</code> 保持不变。</li>
</ul>
</div>
<p><strong class="example">示例 2：</strong></p>
<div class="example-block">
<p><strong>输入：</strong> <span class="example-io">grid = [[0,1],[1,2]]</span></p>
<p><strong>输出：</strong> <span class="example-io">[[2,1],[1,0]]</span></p>
<p><strong>解释：</strong></p>
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/12/29/4052example2adrawio.png" style="width: 383px; height: 141px;" /></p>
<p>标有黑色箭头的对角线必须按非递增顺序排序，因此 <code>[0, 2]</code> 变为 <code>[2, 0]</code>。其他对角线已经符合要求。</p>
</div>
<p><strong class="example">示例 3：</strong></p>
<div class="example-block">
<p><strong>输入：</strong> <span class="example-io">grid = [[1]]</span></p>
<p><strong>输出：</strong> <span class="example-io">[[1]]</span></p>
<p><strong>解释：</strong></p>
<p>只有一个元素的对角线已经符合要求，因此无需修改。</p>
</div>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>grid.length == grid[i].length == n</code></li>
<li><code>1 &lt;= n &lt;= 10</code></li>
<li><code>-10<sup>5</sup> &lt;= grid[i][j] &lt;= 10<sup>5</sup></code></li>
</ul>