mirror of
				https://gitee.com/coder-xiaomo/leetcode-problemset
				synced 2025-11-04 03:33:12 +08:00 
			
		
		
		
	
		
			
				
	
	
		
			47 lines
		
	
	
		
			2.1 KiB
		
	
	
	
		
			HTML
		
	
	
	
	
	
			
		
		
	
	
			47 lines
		
	
	
		
			2.1 KiB
		
	
	
	
		
			HTML
		
	
	
	
	
	
<p>You are given an array of strings <code>nums</code> and an integer <code>k</code>. Each string in <code>nums</code> represents an integer without leading zeros.</p>
 | 
						|
 | 
						|
<p>Return <em>the string that represents the </em><code>k<sup>th</sup></code><em><strong> largest integer</strong> in </em><code>nums</code>.</p>
 | 
						|
 | 
						|
<p><strong>Note</strong>: Duplicate numbers should be counted distinctly. For example, if <code>nums</code> is <code>["1","2","2"]</code>, <code>"2"</code> is the first largest integer, <code>"2"</code> is the second-largest integer, and <code>"1"</code> is the third-largest integer.</p>
 | 
						|
 | 
						|
<p> </p>
 | 
						|
<p><strong class="example">Example 1:</strong></p>
 | 
						|
 | 
						|
<pre>
 | 
						|
<strong>Input:</strong> nums = ["3","6","7","10"], k = 4
 | 
						|
<strong>Output:</strong> "3"
 | 
						|
<strong>Explanation:</strong>
 | 
						|
The numbers in nums sorted in non-decreasing order are ["3","6","7","10"].
 | 
						|
The 4<sup>th</sup> largest integer in nums is "3".
 | 
						|
</pre>
 | 
						|
 | 
						|
<p><strong class="example">Example 2:</strong></p>
 | 
						|
 | 
						|
<pre>
 | 
						|
<strong>Input:</strong> nums = ["2","21","12","1"], k = 3
 | 
						|
<strong>Output:</strong> "2"
 | 
						|
<strong>Explanation:</strong>
 | 
						|
The numbers in nums sorted in non-decreasing order are ["1","2","12","21"].
 | 
						|
The 3<sup>rd</sup> largest integer in nums is "2".
 | 
						|
</pre>
 | 
						|
 | 
						|
<p><strong class="example">Example 3:</strong></p>
 | 
						|
 | 
						|
<pre>
 | 
						|
<strong>Input:</strong> nums = ["0","0"], k = 2
 | 
						|
<strong>Output:</strong> "0"
 | 
						|
<strong>Explanation:</strong>
 | 
						|
The numbers in nums sorted in non-decreasing order are ["0","0"].
 | 
						|
The 2<sup>nd</sup> largest integer in nums is "0".
 | 
						|
</pre>
 | 
						|
 | 
						|
<p> </p>
 | 
						|
<p><strong>Constraints:</strong></p>
 | 
						|
 | 
						|
<ul>
 | 
						|
	<li><code>1 <= k <= nums.length <= 10<sup>4</sup></code></li>
 | 
						|
	<li><code>1 <= nums[i].length <= 100</code></li>
 | 
						|
	<li><code>nums[i]</code> consists of only digits.</li>
 | 
						|
	<li><code>nums[i]</code> will not have any leading zeros.</li>
 | 
						|
</ul>
 |