Commit ac4e899

committed

修正 LaTex 公式

1 parent 4b6f2f0 commit ac4e899Copy full SHA for ac4e899

File tree

-10

lines changed

-10

lines changed

Lines changed: 4 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -345,16 +345,10 @@ while left_1 < len(nums1) and left_2 < len(nums2):`
`345`	`345`	`##### 思路 1:分离双指针`
`346`	`346`
`347`	`347`	`1. 先对 $nums1$ 和 $nums2$ 排序。`
`348`		`-2. 用两个指针 $left\_1$、$left\underline{\hspace{0.`
`349`		`-5em}}2$ 分别从两个数组头部开始遍历。`
`350`		`-3. 若 $nums1[left\_1] == nums2[left\underline`
`351`		`-{\hspace{0.5em}}2],ドル将该元素(去重)加入结果,并同时右移 $left\_1$、$left\underline`
`352`		`-{\hspace{0.5em}}2$。`
`353`		`-4. 若 $nums1[left\_1] < nums2[left\underline`
`354`		`-{\hspace{0.5em}}2],ドル则 $left\_1$ 右移。`
`355`		`-5. 若 $nums1[left\_1] > nums2[left\underline`
`356`		`-{\hspace{0.5em}}2],ドル则 $left\underline`
`357`		`-{\hspace{0.5em}}2$ 右移。`
	`348`	`+2. 用两个指针 $left\_1$、$left\_2$ 分别从两个数组头部开始遍历。`
	`349`	`+3. 若 $nums1[left\_1] == nums2[left\_2],ドル将该元素(去重)加入结果,并同时右移 $left\_1$、$left\_2$。`
	`350`	`+4. 若 $nums1[left\_1] < nums2[left\_2],ドル则 $left\_1$ 右移。`
	`351`	`+5. 若 $nums1[left\_1] > nums2[left\_2],ドル则 $left\_2$ 右移。`
`358`	`352`	`6. 遍历结束后返回结果数组。`
`359`	`353`
`360`	`354`	`##### 思路 1:代码`

Comments

(0)