mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
46 lines
1.9 KiB
HTML
46 lines
1.9 KiB
HTML
<p>A <strong>distinct string</strong> is a string that is present only <strong>once</strong> in an array.</p>
|
|
|
|
<p>Given an array of strings <code>arr</code>, and an integer <code>k</code>, return <em>the </em><code>k<sup>th</sup></code><em> <strong>distinct string</strong> present in </em><code>arr</code>. If there are <strong>fewer</strong> than <code>k</code> distinct strings, return <em>an <strong>empty string </strong></em><code>""</code>.</p>
|
|
|
|
<p>Note that the strings are considered in the <strong>order in which they appear</strong> in the array.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = ["d","b","c","b","c","a"], k = 2
|
|
<strong>Output:</strong> "a"
|
|
<strong>Explanation:</strong>
|
|
The only distinct strings in arr are "d" and "a".
|
|
"d" appears 1<sup>st</sup>, so it is the 1<sup>st</sup> distinct string.
|
|
"a" appears 2<sup>nd</sup>, so it is the 2<sup>nd</sup> distinct string.
|
|
Since k == 2, "a" is returned.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = ["aaa","aa","a"], k = 1
|
|
<strong>Output:</strong> "aaa"
|
|
<strong>Explanation:</strong>
|
|
All strings in arr are distinct, so the 1<sup>st</sup> string "aaa" is returned.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = ["a","b","a"], k = 3
|
|
<strong>Output:</strong> ""
|
|
<strong>Explanation:</strong>
|
|
The only distinct string is "b". Since there are fewer than 3 distinct strings, we return an empty string "".
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= k <= arr.length <= 1000</code></li>
|
|
<li><code>1 <= arr[i].length <= 5</code></li>
|
|
<li><code>arr[i]</code> consists of lowercase English letters.</li>
|
|
</ul>
|