-
Notifications
You must be signed in to change notification settings - Fork 0
/
1282. Group the People Given the Group Size They Belong To
36 lines (29 loc) · 1.45 KB
/
1282. Group the People Given the Group Size They Belong To
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
/*****************************************************************
*There are n people that are split into some unknown number of groups. Each person is labeled with a unique ID from 0 to n - 1.
*You are given an integer array groupSizes, where groupSizes[i] is the size of the group that person i is in. For example, if groupSizes[1] = 3, then person 1 must be in a group of size 3.
*Return a list of groups such that each person i is in a group of size groupSizes[i].
*Each person should appear in exactly one group, and every person must be in a group. If there are multiple answers, return any of them. It is guaranteed that there will be at least one valid solution for the given input.
Example 1:
Input: groupSizes = [3,3,3,3,3,1,3]
Output: [[5],[0,1,2],[3,4,6]]
Explanation:
The first group is [5]. The size is 1, and groupSizes[5] = 1.
The second group is [0,1,2]. The size is 3, and groupSizes[0] = groupSizes[1] = groupSizes[2] = 3.
The third group is [3,4,6]. The size is 3, and groupSizes[3] = groupSizes[4] = groupSizes[6] = 3.
Other possible solutions are [[2,1,6],[5],[0,4,3]] and [[5],[0,6,2],[4,3,1]].
**********************************************************************
class Solution {
public:
int subtractProductAndSum(int n) {
int sum=0;
int prod=1;
while(n!=0){
int digit=n%10;
prod=prod*digit;
sum=sum+digit;
n=n/10;
}
int answer=prod-sum;
return answer;
}
};