-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfizz-buzz.cpp
More file actions
59 lines (46 loc) · 1.19 KB
/
Copy pathfizz-buzz.cpp
File metadata and controls
59 lines (46 loc) · 1.19 KB
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
//question//
Given an integer n, return a string array answer (1-indexed) where:
answer[i] == "FizzBuzz" if i is divisible by 3 and 5.
answer[i] == "Fizz" if i is divisible by 3.
answer[i] == "Buzz" if i is divisible by 5.
answer[i] == i if non of the above conditions are true.
Example 1:
Input: n = 3
Output: ["1","2","Fizz"]
Example 2:
Input: n = 5
Output: ["1","2","Fizz","4","Buzz"]
Example 3:
Input: n = 15
Output: ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"]
Constraints:
1 <= n <= 104
//solution//
class Solution {
public:
vector<string> fizzBuzz(int n) {
vector<string> v;
for(int i=1;i<=n;i++)
{
if(i%3==0 && i%5==0)
{
v.push_back("FizzBuzz");
}
else if(i%3==0)
{
v.push_back("Fizz");
}
else if(i%5==0)
{
v.push_back("Buzz");
}
else
{
string s="";
s += to_string(i);
v.push_back(s);
}
}
return v;
}
};