iT邦幫忙

2024 iThome 鐵人賽

DAY 4
0

412.Fizz Buzz

題目敘述:

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 (as a string) if none 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"]

程式碼:

class Solution {
public:
    vector<string> fizzBuzz(int n) {
        vector <string> arr;
        for (int i = 1 ; i<=n ; i++ ){
            if(i%3==0){
                if(i%5==0){
                    arr.push_back("FizzBuzz");
                }
                else{
                    arr.push_back("Fizz");
                }
            }
            else if(i%5==0){
                arr.push_back("Buzz");
            }
            else{
                int m = i;
                string j ;
                while(m!=0){
                    int k = m%10;
                    char h = k + '0';
                    m = m/10;
                    j = h +j;
                }
                arr.push_back(j);
            }
        }
        return arr; 
    }
};

上一篇
每日一LeetCode(3)
下一篇
每日一LeetCode(5)
系列文
Leetcode 解題之旅:逐日攻克17
圖片
  直播研討會
圖片
{{ item.channelVendor }} {{ item.webinarstarted }} |
{{ formatDate(item.duration) }}
直播中

尚未有邦友留言

立即登入留言