mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-11 18:31:41 +08:00
更新国内版力扣题目描述变更
This commit is contained in:
@@ -1,8 +1,8 @@
|
||||
<p>Write a method that finds the maximum of two numbers. You should not use if-else or any other comparison operator.</p>
|
||||
|
||||
<p><strong>Example: </strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input: </strong> a = 1, b = 2
|
||||
<strong>Output: </strong> 2
|
||||
</pre>
|
||||
<p>Write a method that finds the maximum of two numbers. You should not use if-else or any other comparison operator.</p>
|
||||
|
||||
|
||||
|
||||
<p><strong>Example: </strong></p>
|
||||
|
||||
|
||||
|
||||
|
Reference in New Issue
Block a user