forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
New Problem Solution - "1822. Sign of the Product of an Array"
- Loading branch information
Showing
2 changed files
with
52 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
51 changes: 51 additions & 0 deletions
51
algorithms/cpp/signOfTheProductOfAnArray/SignOfTheProductOfAnArray.cpp
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,51 @@ | ||
// Source : https://leetcode.com/problems/sign-of-the-product-of-an-array/ | ||
// Author : Hao Chen | ||
// Date : 2021-04-11 | ||
|
||
/***************************************************************************************************** | ||
* | ||
* There is a function signFunc(x) that returns: | ||
* | ||
* 1 if x is positive. | ||
* -1 if x is negative. | ||
* 0 if x is equal to 0. | ||
* | ||
* You are given an integer array nums. Let product be the product of all values in the array nums. | ||
* | ||
* Return signFunc(product). | ||
* | ||
* Example 1: | ||
* | ||
* Input: nums = [-1,-2,-3,-4,3,2,1] | ||
* Output: 1 | ||
* Explanation: The product of all values in the array is 144, and signFunc(144) = 1 | ||
* | ||
* Example 2: | ||
* | ||
* Input: nums = [1,5,0,2,-3] | ||
* Output: 0 | ||
* Explanation: The product of all values in the array is 0, and signFunc(0) = 0 | ||
* | ||
* Example 3: | ||
* | ||
* Input: nums = [-1,1,-1,1,-1] | ||
* Output: -1 | ||
* Explanation: The product of all values in the array is -1, and signFunc(-1) = -1 | ||
* | ||
* Constraints: | ||
* | ||
* 1 <= nums.length <= 1000 | ||
* -100 <= nums[i] <= 100 | ||
******************************************************************************************************/ | ||
|
||
class Solution { | ||
public: | ||
int arraySign(vector<int>& nums) { | ||
int negtive=0; | ||
for(auto& n : nums) { | ||
if (n==0) return 0; | ||
if (n < 0) negtive++; | ||
} | ||
return negtive % 2 == 0 ? 1 : -1; | ||
} | ||
}; |