mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-09 01:11:42 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p><strong>句子</strong> 是一串由空格分隔的单词。每个 <strong>单词</strong><em> </em>仅由小写字母组成。</p>\n\n<p>如果某个单词在其中一个句子中恰好出现一次,在另一个句子中却 <strong>没有出现</strong> ,那么这个单词就是 <strong>不常见的</strong><em> </em>。</p>\n\n<p>给你两个 <strong>句子</strong> <code>s1</code> 和 <code>s2</code> ,返回所有 <strong>不常用单词</strong> 的列表。返回列表中单词可以按 <strong>任意顺序</strong> 组织。</p>\n\n<p> </p>\n\n<ol>\n</ol>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>s1 = \"this apple is sweet\", s2 = \"this apple is sour\"\n<strong>输出:</strong>[\"sweet\",\"sour\"]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>s1 = \"apple apple\", s2 = \"banana\"\n<strong>输出:</strong>[\"banana\"]\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= s1.length, s2.length <= 200</code></li>\n\t<li><code>s1</code> 和 <code>s2</code> 由小写英文字母和空格组成</li>\n\t<li><code>s1</code> 和 <code>s2</code> 都不含前导或尾随空格</li>\n\t<li><code>s1</code> 和 <code>s2</code> 中的所有单词间均由单个空格分隔</li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 158,
|
||||
"likes": 159,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"42K\", \"totalSubmission\": \"58.3K\", \"totalAcceptedRaw\": 41995, \"totalSubmissionRaw\": 58299, \"acRate\": \"72.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"42.5K\", \"totalSubmission\": \"59K\", \"totalAcceptedRaw\": 42487, \"totalSubmissionRaw\": 58978, \"acRate\": \"72.0%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "73",
|
||||
|
Reference in New Issue
Block a user