leetcode 412. Fizz Buzz

最新推荐文章于 2024-11-23 18:16:46 发布

原创最新推荐文章于 2024-11-23 18:16:46 发布 · 318 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

261 篇文章

订阅专栏

leetcode

257 篇文章

订阅专栏

本文介绍了一个简单的FizzBuzz程序实现方法，使用Java语言展示了如何根据指定范围输出数字、Fizz、Buzz及FizzBuzz，并提供了一种不使用取余运算符的创新解法。

Write a program that outputs the string representation of numbers from 1 to n.

But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”.

Example:

n = 15,

Return:
[
    "1",
    "2",
    "Fizz",
    "4",
    "Buzz",
    "Fizz",
    "7",
    "8",
    "Fizz",
    "Buzz",
    "11",
    "Fizz",
    "13",
    "14",
    "FizzBuzz"
]

这个非常的简单了。需要注意的是list是interface，不能直接new list

import java.util.ArrayList;
import java.util.List;

public class Fizz_Buzz_412 {

	public List<String> fizzBuzz(int n) {
		List<String> result=new ArrayList<String>();
		for(int i=1;i<=n;i++){
			if(i%15==0){
				result.add("FizzBuzz");
			}
			else if(i%3==0){
				result.add("Fizz");
			}
			else if(i%5==0){
				result.add("Buzz");
			}
			else{
				result.add(String.valueOf(i));
			}
		}
		return result;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Fizz_Buzz_412 f=new Fizz_Buzz_412();
		List<String> list=f.fizzBuzz(15);
		for (int i = 0; i < list.size(); i++) {
		    System.out.println(list.get(i));
		};

	}

}

此外，发现了大神的不用%的解法，这个思路也是很妙啊！

public class Solution {
    public List<String> fizzBuzz(int n) {
        List<String> ret = new ArrayList<String>(n);
        for(int i=1,fizz=0,buzz=0;i<=n ;i++){
            fizz++;
            buzz++;
            if(fizz==3 && buzz==5){
                ret.add("FizzBuzz");
                fizz=0;
                buzz=0;
            }else if(fizz==3){
                ret.add("Fizz");
                fizz=0;
            }else if(buzz==5){
                ret.add("Buzz");
                buzz=0;
            }else{
                ret.add(String.valueOf(i));
            }
        } 
        return ret;
    }
}