mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
33 lines
1.1 KiB
HTML
33 lines
1.1 KiB
HTML
<p>某班级考试成绩按非严格递增顺序记录于整数数组 <code>scores</code>，请返回目标成绩 <code>target</code> 的出现次数。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入:</strong> scores = [2, 2, 3, 4, 4, 4, 5, 6, 6, 8], target = 4
|
||
<strong>输出:</strong> 3</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入:</strong> scores = [1, 2, 3, 5, 7, 9], target = 6
|
||
<strong>输出:</strong> 0</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>0 <= scores.length <= 10<sup>5</sup></code></li>
|
||
<li><code>-10<sup>9</sup> <= scores[i] <= 10<sup>9</sup></code></li>
|
||
<li><code>scores</code> 是一个非递减数组</li>
|
||
<li><code>-10<sup>9</sup> <= target <= 10<sup>9</sup></code></li>
|
||
</ul>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>注意：</strong>本题与主站 34 题相同（仅返回值不同）：<a href="https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/">https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/</a></p>
|
||
|
||
<p> </p>
|