-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMaximumCountOfPositiveIntegerAndNegativeInteger.php
More file actions
48 lines (46 loc) · 1.46 KB
/
Copy pathMaximumCountOfPositiveIntegerAndNegativeInteger.php
File metadata and controls
48 lines (46 loc) · 1.46 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
<?php
namespace App;
/**
* Maximum Count of Positive Integer and Negative Integer
*
* Given an array nums sorted in non-decreasing order, return the maximum between the number of positive integers and
* the number of negative integers. In other words, if the number of positive integers in nums is pos and the number of
* negative integers is neg, then return the maximum of pos and neg. Note that 0 is neither positive nor negative.
*
* Example 1:
* Input: nums = [-2,-1,-1,1,2,3]
* Output: 3
* Explanation: There are 3 positive integers and 3 negative integers. The maximum count among them is 3.
*
* Example 2:
* Input: nums = [-3,-2,-1,0,0,1,2]
* Output: 3
* Explanation: There are 2 positive integers and 3 negative integers. The maximum count among them is 3.
*
* Example 3:
* Input: nums = [5,20,66,1314]
* Output: 4
* Explanation: There are 4 positive integers and 0 negative integers. The maximum count among them is 4.
*
* https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer
*/
class MaximumCountOfPositiveIntegerAndNegativeInteger
{
/**
* @param int[] $nums
* @return int
*/
public function maximumCount(array $nums): int
{
$positive = 0;
$negative = 0;
foreach ($nums as $num) {
if ($num > 0) {
$positive++;
} elseif ($num < 0) {
$negative++;
}
}
return max($positive, $negative);
}
}