Skip to content
Go back

2529-maximum-count-of-positive-integer-and-negative-integer

2529 https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer/

struct Solutioin {}

impl Solution {
  pub fn maximum_count(nums: Vec<i32>) -> i32 {
    let (p, n): (i32, i32) = nums.iter().fold((0, 0), |(p, n), &v| {
      if v > 0 {
        (p + 1, n)
      } else if v < 0 {
        (p, n + 1)
      } else {
        (p, n)
      }
    });
    p.max(n)
  }
}

Share this post on:

Previous Post
2591-distribute-money-to-maximum-children
Next Post
1574-shortest-subarray-to-be-removed-to-make-array-sorted