Leetcode 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 if non of the above conditions are true.

太简单了，小菜一碟，直接上代码
唯一值得注意的是，判断3和5共同的倍数的条件语句要写在最前面，因为它的条件最苛刻，若写在后面会被“截胡”。

class Solution {
    public List<String> fizzBuzz(int n) {
        List<String> list=new ArrayList<>();
        for(int i=1; i<=n; i++){
            if((i%3==0)&&(i%5==0)){
                list.add("FizzBuzz");
            }
            else if(i%3==0){
                list.add("Fizz");
            }
            else if(i%5==0){
                list.add("Buzz");
            }
            else{
                list.add(Integer.toString(i));
            }
        }
        return list;
    }
}

时间复杂度: O(n)