mirror of
				https://gitee.com/coder-xiaomo/leetcode-problemset
				synced 2025-11-04 19:53:12 +08:00 
			
		
		
		
	
		
			
				
	
	
		
			71 lines
		
	
	
		
			2.6 KiB
		
	
	
	
		
			HTML
		
	
	
	
	
	
			
		
		
	
	
			71 lines
		
	
	
		
			2.6 KiB
		
	
	
	
		
			HTML
		
	
	
	
	
	
<p>给你一个下标从 <strong>0</strong> 开始的 <strong>非递减</strong> 整数数组 <code>nums</code> 。</p>
 | 
						||
 | 
						||
<p>你可以执行以下操作任意次:</p>
 | 
						||
 | 
						||
<ul>
 | 
						||
	<li>选择 <strong>两个 </strong>下标 <code>i</code> 和 <code>j</code> ,满足 <code>nums[i] < nums[j]</code> 。</li>
 | 
						||
	<li>将 <code>nums</code> 中下标在 <code>i</code> 和 <code>j</code> 处的元素删除。剩余元素按照原来的顺序组成新的数组,下标也重新从 <strong>0</strong> 开始编号。</li>
 | 
						||
</ul>
 | 
						||
 | 
						||
<p>请你返回一个整数,表示执行以上操作任意次后(可以执行 <strong>0</strong> 次),<code>nums</code> 数组的 <strong>最小</strong> 数组长度。</p>
 | 
						||
 | 
						||
<p> </p>
 | 
						||
 | 
						||
<p><strong class="example">示例 1:</strong></p>
 | 
						||
 | 
						||
<div class="example-block">
 | 
						||
<p><strong>输入:</strong><span class="example-io">nums = [1,2,3,4]</span></p>
 | 
						||
 | 
						||
<p><strong>输出:</strong><span class="example-io">0</span></p>
 | 
						||
 | 
						||
<p><strong>解释:</strong></p>
 | 
						||
 | 
						||
<p><img src="https://pic.leetcode.cn/1716779983-AHhkVn-tcase1.gif" style="width: 160px; height: 70px;" /></p>
 | 
						||
</div>
 | 
						||
 | 
						||
<p><strong class="example">示例 2:</strong></p>
 | 
						||
 | 
						||
<div class="example-block">
 | 
						||
<p><strong>输入:</strong><span class="example-io">nums = [1,1,2,2,3,3]</span></p>
 | 
						||
 | 
						||
<p><strong>输出:</strong><span class="example-io">0</span></p>
 | 
						||
 | 
						||
<p><strong>解释:</strong></p>
 | 
						||
 | 
						||
<p><img src="https://pic.leetcode.cn/1716779979-GyQhVf-tcase2.gif" style="width: 240px; height: 70px;" /></p>
 | 
						||
</div>
 | 
						||
 | 
						||
<p><strong class="example">示例 3:</strong></p>
 | 
						||
 | 
						||
<div class="example-block">
 | 
						||
<p><strong>输入:</strong><span class="example-io">nums = [1000000000,1000000000]</span></p>
 | 
						||
 | 
						||
<p><strong>输出:</strong><span class="example-io">2</span></p>
 | 
						||
 | 
						||
<p><strong>解释:</strong></p>
 | 
						||
 | 
						||
<p>由于两个数字相等,不能删除它们。</p>
 | 
						||
</div>
 | 
						||
 | 
						||
<p><strong class="example">示例 4:</strong></p>
 | 
						||
 | 
						||
<div class="example-block">
 | 
						||
<p><strong>输入:</strong><span class="example-io">nums = [2,3,4,4,4]</span></p>
 | 
						||
 | 
						||
<p><strong>输出:</strong><span class="example-io">1</span></p>
 | 
						||
 | 
						||
<p><strong>解释:</strong></p>
 | 
						||
 | 
						||
<p><img src="https://pic.leetcode.cn/1716779940-qRRlHk-tcase3.gif" style="width: 210px; height: 70px;" /></p>
 | 
						||
</div>
 | 
						||
 | 
						||
<p> </p>
 | 
						||
 | 
						||
<p><strong>提示:</strong></p>
 | 
						||
 | 
						||
<ul>
 | 
						||
	<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
 | 
						||
	<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>
 | 
						||
	<li><code>nums</code> 是 <strong>非递减</strong> 数组。</li>
 | 
						||
</ul>
 |