mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>编写一个方法,找出两个数字<code>a</code>和<code>b</code>中最大的那一个。不得使用if-else或其他比较运算符。</p>\n<p><strong>示例:</strong></p>\n<pre><strong>输入:</strong> a = 1, b = 2\n<strong>输出:</strong> 2\n</pre>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 110,
|
||||
"likes": 112,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"32.3K\", \"totalAcceptedRaw\": 23659, \"totalSubmissionRaw\": 32264, \"acRate\": \"73.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"24.5K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 24502, \"totalSubmissionRaw\": 33431, \"acRate\": \"73.3%\"}",
|
||||
"hints": [
|
||||
"如果a > b,则k为1,否则为0。如果给定k,你能返回最大值吗(没有比较或if-else逻辑)?",
|
||||
"如果当a > b时,k等于1,那么当k等于0时则相反,然后你可以返回a*k + b* (非k)。但你如何创建k?",
|
||||
|
Reference in New Issue
Block a user