Commit 817fb52

committed

Refactor comments and clean up code in Minimum Operations solution

1 parent e9ed525 commit 817fb52Copy full SHA for 817fb52

File tree

-9

lines changed

-9

lines changed

Lines changed: 5 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -24,32 +24,28 @@ class Solution`
`24`	`24`	`$target = 2 * $k - $num;`
`25`	`25`
`26`	`26`	`if (isset($freq[$target])) {`
	`27`	`+`
`27`	`28`	`if ($num == $target) {`
`28`		`- // Use pairs within the same value`
`29`	`29`	`$pairCount = intdiv($freq[$num], 2);`
`30`	`30`	`$pairs += $pairCount;`
`31`	`31`	`$freq[$num] -= $pairCount * 2;`
`32`	`32`	`} elseif ($num < $target) {`
`33`		`- // Pair num with target`
`34`	`33`	`$pairCount = min($freq[$num], $freq[$target]);`
`35`	`34`	`$pairs += $pairCount;`
`36`	`35`	`$freq[$num] -= $pairCount;`
`37`	`36`	`$freq[$target] -= $pairCount;`
`38`	`37`	`}`
`39`	`38`	`}`
`40`	`39`	`}`
`41`		`-`
`42`		`- // After using valid pairs, each of the remaining non-k elements needs 1 op`
`43`	`40`	`return $nonK - $pairs * 2;`
`44`	`41`	`}`
`45`	`42`	`}`
`46`		`-`
`47`	`43`	`$solution = new Solution();`
`48`	`44`
`49`		`-$nums = [1, 2, 3, 4, 5];// Example input array`
	`45`	`+$nums = [1, 2, 3, 4, 5];`
`50`	`46`
`51`		`-$k = 3;// Example target value`
	`47`	`+$k = 3;`
`52`	`48`
`53`		`-$result = $solution->minOperations($nums, $k);// Call the function with the example input`
	`49`	`+$result = $solution->minOperations($nums, $k);`
`54`	`50`
`55`		`-echo $result;// Output: 4 (Explanation: The minimum number of operations required to make all elements equal to 3 is 4)`
	`51`	`+echo $result;`

Comments

(0)