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
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 | int countNegatives(int** grid, int gridSize, int* gridColSize){ int cnt=0; int firstIndex = *gridColSize; for(int i=0;i<gridSize;++i){ while(firstIndex>0 && grid[i][firstIndex-1]<0){ --firstIndex; } if(firstIndex==0){ cnt += *gridColSize * (gridSize-i); break; } else{ cnt += *gridColSize - firstIndex; } } return cnt; } |
Wow! At last I got a web site from where I know how to really obtain valuable facts regarding my study and knowledge. Bren Fred Dylane
Way cool! Some very valid points! I appreciate you writing this write-up and also the rest of the website is very good. Letty Garek Dacia
I have read so many posts concerning the blogger lovers but this post is genuinely a good post, keep it up. Hynda Farlay Carlin
Some truly nice and utilitarian information on this website, too I believe the pattern contains great features. Tawnya Meir Market
Asking questions are in fact good thing if you are not understanding anything totally, but this post provides fastidious understanding even. Casandra Ned Surbeck
Thanks so much for the article post. Really looking forward to read more. Want more. Karla Tonnie Marcille
Some really select articles on this internet site , saved to favorites . Thomasine Ethelred Bar
I love surfing on your pleasant site
I loved your blog.Really looking forward to read more. Will read on…
Thanks so much for the blog post.Thanks Again. Great.
You produce quality content, I appreciate you
I really like the design and contents of your web page
Wow, great blog article.Really thank you! Really Great.