mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
50
leetcode-cn/problem (Chinese)/包装数组 [array-wrapper].html
Normal file
50
leetcode-cn/problem (Chinese)/包装数组 [array-wrapper].html
Normal file
@@ -0,0 +1,50 @@
|
||||
<p>创建一个名为 <code>ArrayWrapper</code> 的类,它在其构造函数中接受一个整数数组作为参数。该类应具有以下两个特性:</p>
|
||||
|
||||
<ul>
|
||||
<li>当使用 <code>+</code> 运算符将两个该类的实例相加时,结果值为两个数组中所有元素的总和。</li>
|
||||
<li>当在实例上调用 <code>String()</code> 函数时,它将返回一个由逗号分隔的括在方括号中的字符串。例如,<code>[1,2,3]</code> 。</li>
|
||||
</ul>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入:</b>nums = [[1,2],[3,4]], operation = "Add"
|
||||
<b>输出:</b>10
|
||||
<b>解释:</b>
|
||||
const obj1 = new ArrayWrapper([1,2]);
|
||||
const obj2 = new ArrayWrapper([3,4]);
|
||||
obj1 + obj2; // 10
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入:</b>nums = [[23,98,42,70]], operation = "String"
|
||||
<b>输出:</b>"[23,98,42,70]"
|
||||
<strong>解释:</strong>
|
||||
const obj = new ArrayWrapper([23,98,42,70]);
|
||||
String(obj); // "[23,98,42,70]"
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入:</b>nums = [[],[]], operation = "Add"
|
||||
<b>输出:</b>0
|
||||
<strong>解释:</strong>
|
||||
const obj1 = new ArrayWrapper([]);
|
||||
const obj2 = new ArrayWrapper([]);
|
||||
obj1 + obj2; // 0
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><b>提示:</b></p>
|
||||
|
||||
<ul>
|
||||
<li><code>0 <= nums.length <= 1000</code></li>
|
||||
<li><code>0 <= nums[i] <= 1000</code></li>
|
||||
<li><code>注意:nums 是传递给构造函数的数组。</code></li>
|
||||
</ul>
|
Reference in New Issue
Block a user