-
-
Notifications
You must be signed in to change notification settings - Fork 8
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Returns array with negatives from nested arrays
14th exercise - #1351 https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/submissions/
- Loading branch information
1 parent
47a4ed8
commit 9e1543e
Showing
1 changed file
with
42 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,42 @@ | ||
/* | ||
Given a m * n matrix grid which is sorted in non-increasing order both row-wise and column-wise. | ||
Return the number of negative numbers in grid. | ||
Example 1: | ||
Input: grid = [[4,3,2,-1],[3,2,1,-1],[1,1,-1,-2],[-1,-1,-2,-3]] | ||
Output: 8 | ||
Explanation: There are 8 negatives number in the matrix. | ||
Example 2: | ||
Input: grid = [[3,2],[1,0]] | ||
Output: 0 | ||
Example 3: | ||
Input: grid = [[1,-1],[-1,-1]] | ||
Output: 3 | ||
Example 4: | ||
Input: grid = [[-1]] | ||
Output: 1 | ||
Constraints: | ||
m == grid.length | ||
n == grid[i].length | ||
1 <= m, n <= 100 | ||
-100 <= grid[i][j] <= 100 | ||
*/ | ||
|
||
//Answer// | ||
/** | ||
* @param {number[][]} grid | ||
* @return {number} | ||
*/ | ||
var countNegatives = function(grid) { | ||
return grid.map(x=>x.filter(y=>y<0).length).reduce((a, b) => a + b) | ||
}; |