mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 22:13:28 +08:00
update
This commit is contained in:
5
leetcode-cn/problem (Chinese)/最大数值 [maximum-lcci].html
Normal file
5
leetcode-cn/problem (Chinese)/最大数值 [maximum-lcci].html
Normal file
@@ -0,0 +1,5 @@
|
||||
<p>编写一个方法,找出两个数字<code>a</code>和<code>b</code>中最大的那一个。不得使用if-else或其他比较运算符。</p>
|
||||
<p><strong>示例:</strong></p>
|
||||
<pre><strong>输入:</strong> a = 1, b = 2
|
||||
<strong>输出:</strong> 2
|
||||
</pre>
|
Reference in New Issue
Block a user