mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
49 lines
1.5 KiB
HTML
49 lines
1.5 KiB
HTML
|
<p>给你一个 <strong>数字</strong> 字符串数组 <code>nums</code> 和一个 <strong>数字</strong> 字符串 <code>target</code> ，请你返回 <code>nums[i] + nums[j]</code> （两个字符串连接）结果等于 <code>target</code> 的下标 <code>(i, j)</code> （需满足 <code>i != j</code>）的数目。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><b>输入：</b>nums = ["777","7","77","77"], target = "7777"
|
|||
|
|
<b>输出：</b>4
|
|||
|
|
<b>解释：</b>符合要求的下标对包括：
|
|||
|
|
- (0, 1)："777" + "7"
|
|||
|
|
- (1, 0)："7" + "777"
|
|||
|
|
- (2, 3)："77" + "77"
|
|||
|
|
- (3, 2)："77" + "77"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><b>输入：</b>nums = ["123","4","12","34"], target = "1234"
|
|||
|
|
<b>输出：</b>2
|
|||
|
|
<b>解释：</b>符合要求的下标对包括
|
|||
|
|
- (0, 1)："123" + "4"
|
|||
|
|
- (2, 3)："12" + "34"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><b>输入：</b>nums = ["1","1","1"], target = "11"
|
|||
|
|
<b>输出：</b>6
|
|||
|
|
<b>解释：</b>符合要求的下标对包括
|
|||
|
|
- (0, 1)："1" + "1"
|
|||
|
|
- (1, 0)："1" + "1"
|
|||
|
|
- (0, 2)："1" + "1"
|
|||
|
|
- (2, 0)："1" + "1"
|
|||
|
|
- (1, 2)："1" + "1"
|
|||
|
|
- (2, 1)："1" + "1"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>2 <= nums.length <= 100</code></li>
|
|||
|
|
<li><code>1 <= nums[i].length <= 100</code></li>
|
|||
|
|
<li><code>2 <= target.length <= 100</code></li>
|
|||
|
|
<li><code>nums[i]</code> 和 <code>target</code> 只包含数字。</li>
|
|||
|
|
<li><code>nums[i]</code> 和 <code>target</code> 不含有任何前导 0 。</li>
|
|||
|
|
</ul>
|