1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国外版力扣题目描述变更

This commit is contained in:
2022-05-02 23:40:02 +08:00
parent 7646741306
commit 7deedf5990
11 changed files with 38 additions and 25 deletions

View File

@@ -27,6 +27,14 @@ We choose one 1 from [1,1] in 2 ways,
and two 2s from [2,2,2,2] in 6 ways.
</pre>
<p><strong>Example 3:</strong></p>
<pre>
<strong>Input:</strong> arr = [2,1,3], target = 6
<strong>Output:</strong> 1
<strong>Explanation:</strong> (1, 2, 3) occured one time in the array so we return 1.
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>