Commit 6b0bbbe

committed

Update 03.LeetCode-Guide.md

1 parent 865d9ee commit 6b0bbbeCopy full SHA for 6b0bbbe

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -125,7 +125,7 @@ LeetCode 提供了题目的搜索过滤功能。可以筛选相关题单、不`
`125`	`125`	`##### 思路 1:枚举算法`
`126`	`126`
`127`	`127`	`1. 使用两重循环枚举数组中每一个数 $nums[i]$、$nums[j],ドル判断所有的 $nums[i] + nums[j]$ 是否等于 $target$。`
`128`		`-2. 如果出现 $nums[i] + nums[j] == target,ドル则说明数组中存在和为 $target$ 的两个整数,将两个整数的下标 $i$、$$j$ 输出即可。`
	`128`	`+2. 如果出现 $nums[i] + nums[j] == target,ドル则说明数组中存在和为 $target$ 的两个整数,将两个整数的下标 $i$、$j$ 输出即可。`
`129`	`129`
`130`	`130`	`##### 思路 1:代码`
`131`	`131`

Comments

(0)