imajinyun /
leetcode-php
| Conditions | 4 |
| Paths | 4 |
| Total Lines | 15 |
| Code Lines | 9 |
| Lines | 0 |
| Ratio | 0 % |
| Changes | 2 | ||
| Bugs | 0 | Features | 0 |
| 1 | <?php |
||
| 9 | public static function removeDuplicates(array &$nums): int |
||
| 10 | { |
||
| 11 | if (($n = count($nums)) === 0) { |
||
| 12 | return 0; |
||
| 13 | } |
||
| 14 | $k = 0; |
||
| 15 | for ($i = 1; $i < $n; $i++) { |
||
| 16 | if ($nums[$i] === $nums[$i - 1]) { |
||
| 17 | $k++; |
||
| 18 | } else { |
||
| 19 | $nums[$i - $k] = $nums[$i]; |
||
| 20 | } |
||
| 21 | } |
||
| 22 | |||
| 23 | return $n - $k; |
||
| 24 | } |
||
| 41 |
