Commit 2ccabb7

committed

🐱(double-pointer): 16. 最接近的三数之和 - 补充 PHP 解法

1 parent ce72b12 commit 2ccabb7Copy full SHA for 2ccabb7

File tree

+39

-0

lines changed

+39

-0

lines changed

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -33,6 +33,45 @@ class Solution:`
`33`	`33`	`return ans`
`34`	`34`	```
`35`	`35`
	`36`	+```php
	`37`	`+class Solution {`
	`38`	`+`
	`39`	`+ /**`
	`40`	`+ * @param Integer[] $nums`
	`41`	`+ * @param Integer $target`
	`42`	`+ * @return Integer`
	`43`	`+ */`
	`44`	`+ function threeSumClosest($nums, $target) {`
	`45`	`+ $length = count($nums);`
	`46`	`+ if ($length < 3) {`
	`47`	`+ return 0;`
	`48`	`+ }`
	`49`	`+ sort($nums);`
	`50`	`+ $ans = $nums[0] + $nums[1] + $nums[2];`
	`51`	`+ $sum = 0;`
	`52`	`+ for ($i = 0; $i < $length; $i++) {`
	`53`	`+ $num = $nums[$i];`
	`54`	`+ $start = $i + 1;`
	`55`	`+ $end = $length - 1;`
	`56`	`+ while($start < $end) {`
	`57`	`+ $sum = $num + $nums[$start] + $nums[$end];`
	`58`	`+ if(abs($sum - $target) < abs($ans - $target)) {`
	`59`	`+ $ans = $sum;`
	`60`	`+ }`
	`61`	`+ if ($sum < $target) {`
	`62`	`+ $start++;`
	`63`	`+ } elseif ($sum > $target) {`
	`64`	`+ $end--;`
	`65`	`+ } else {`
	`66`	`+ return $ans;`
	`67`	`+ }`
	`68`	`+ }`
	`69`	`+ }`
	`70`	`+ return $ans;`
	`71`	`+ }`
	`72`	`+}`
	`73`	+```
	`74`	`+`
`36`	`75`	`## 392. 判断子序列`
`37`	`76`
`38`	`77`	`[原题链接](https://leetcode-cn.com/problems/is-subsequence/)`

Comments

(0)