Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit 6631f23

Browse files
add 2529
1 parent 70a4eb0 commit 6631f23

File tree

2 files changed

+20
-6
lines changed

2 files changed

+20
-6
lines changed

README.md

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -8,14 +8,10 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
11-
<<<<<<< Updated upstream
12-
| 2515 |[Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2515.java) |[:tv:](https://youtu.be/yTpRd3yvyz0)| Easy ||
13-
| 2520 |[Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2520.java) |[:tv:](https://youtu.be/7SHHsS5kPJ8)| Easy ||
14-
=======
1511
| 2530 |[Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2530.java) || Medium |
16-
| 2515 |[Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2515.java) || Easy ||
12+
| 2529 |[Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2515.java) || Easy ||
1713
| 2520 |[Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2520.java) | [:tv:](https://youtu.be/7SHHsS5kPJ8) | Easy ||
18-
>>>>>>> Stashed changes
14+
| 2515 |[Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2515.java) || Easy ||
1915
| 2496 |[Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2496.java) || Easy ||
2016
| 2467 |[Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2469.java) || Easy ||
2117
| 2455 |[Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2455.java) || Easy ||
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
package com.fishercoder.solutions;
2+
3+
public class _2529 {
4+
public static class Solution1 {
5+
public int maximumCount(int[] nums) {
6+
int pos = 0;
7+
int neg = 0;
8+
for (int num : nums) {
9+
if (num > 0) {
10+
pos++;
11+
} else if (num < 0) {
12+
neg++;
13+
}
14+
}
15+
return Math.max(pos, neg);
16+
}
17+
}
18+
}

0 commit comments

Comments
 (0)