DailyDose/ArraySign-LCQ.cpp at main · Shrivishnu22/DailyDose · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/*
Sign of the Product of an Array

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 result, count = 0, mid = nums.size() / 2;
		bool flag = true;
		for (auto it : nums) {
			if (it == 0) {
				flag = false;
				result = 0;
				break;
			} else if (it < 0)
				count++;
		}
		if (count % 2 != 0 && flag)
			result = -1;
		else if (flag)
			result = 1;
		return result;

	}
};