mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>某城市开了一家新的电影院,吸引了很多人过来看电影。该电影院特别注意用户体验,专门有个 LED显示板做电影推荐,上面公布着影评和相关电影描述。</p>\n\n<p>作为该电影院的信息部主管,您需要编写一个 SQL查询,找出所有影片描述为<strong>非</strong> <code>boring</code> (不无聊) 的并且<strong> id 为奇数 </strong>的影片,结果请按等级 <code>rating</code> 排列。</p>\n\n<p> </p>\n\n<p>例如,下表 <code>cinema</code>:</p>\n\n<pre>\n+---------+-----------+--------------+-----------+\n| id | movie | description | rating |\n+---------+-----------+--------------+-----------+\n| 1 | War | great 3D | 8.9 |\n| 2 | Science | fiction | 8.5 |\n| 3 | irish | boring | 6.2 |\n| 4 | Ice song | Fantacy | 8.6 |\n| 5 | House card| Interesting| 9.1 |\n+---------+-----------+--------------+-----------+\n</pre>\n\n<p>对于上面的例子,则正确的输出是为:</p>\n\n<pre>\n+---------+-----------+--------------+-----------+\n| id | movie | description | rating |\n+---------+-----------+--------------+-----------+\n| 5 | House card| Interesting| 9.1 |\n| 1 | War | great 3D | 8.9 |\n+---------+-----------+--------------+-----------+\n</pre>\n\n<p> </p>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 147,
|
||||
"likes": 149,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -47,7 +47,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"106.8K\", \"totalSubmission\": \"138.4K\", \"totalAcceptedRaw\": 106815, \"totalSubmissionRaw\": 138387, \"acRate\": \"77.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"109K\", \"totalSubmission\": \"141.1K\", \"totalAcceptedRaw\": 108981, \"totalSubmissionRaw\": 141138, \"acRate\": \"77.2%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "95",
|
||||
|
Reference in New Issue
Block a user