1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 14:58:56 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给你一个整数数组 <code>nums</code> ,统计并返回在 <code>nums</code> 中同时至少具有一个严格较小元素和一个严格较大元素的元素数目。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>nums = [11,7,2,15]\n<strong>输出:</strong>2\n<strong>解释:</strong>元素 7 :严格较小元素是元素 2 ,严格较大元素是元素 11 。\n元素 11 :严格较小元素是元素 7 ,严格较大元素是元素 15 。\n总计有 2 个元素都满足在 nums 中同时存在一个严格较小元素和一个严格较大元素。\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>nums = [-3,3,3,90]\n<strong>输出:</strong>2\n<strong>解释:</strong>元素 3 :严格较小元素是元素 -3 ,严格较大元素是元素 90 。\n由于有两个元素的值为 3 ,总计有 2 个元素都满足在 nums 中同时存在一个严格较小元素和一个严格较大元素。\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= nums.length &lt;= 100</code></li>\n\t<li><code>-10<sup>5</sup> &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 9,
"likes": 10,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.1K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 8131, \"totalSubmissionRaw\": 14060, \"acRate\": \"57.8%\"}",
"stats": "{\"totalAccepted\": \"8.5K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 8522, \"totalSubmissionRaw\": 14727, \"acRate\": \"57.9%\"}",
"hints": [
"All the elements in the array should be counted except for the minimum and maximum elements.",
"If the array has n elements, the answer will be n - count(min(nums)) - count(max(nums))",