首页 > 其他分享 >LeetCode 1195. Fizz Buzz Multithreaded

LeetCode 1195. Fizz Buzz Multithreaded

时间:2022-10-11 14:24:56浏览次数:70  
标签:word fizzbuzz Buzz 1195 FizzBuzz buzz output LeetCode fizz

原题链接在这里:https://leetcode.com/problems/fizz-buzz-multithreaded/

题目:

You have the four functions:

  • printFizz that prints the word "fizz" to the console,
  • printBuzz that prints the word "buzz" to the console,
  • printFizzBuzz that prints the word "fizzbuzz" to the console, and
  • printNumber that prints a given integer to the console.

You are given an instance of the class FizzBuzz that has four functions: fizzbuzzfizzbuzz and number. The same instance of FizzBuzz will be passed to four different threads:

  • Thread A: calls fizz() that should output the word "fizz".
  • Thread B: calls buzz() that should output the word "buzz".
  • Thread C: calls fizzbuzz() that should output the word "fizzbuzz".
  • Thread D: calls number() that should only output the integers.

Modify the given class to output the series [1, 2, "fizz", 4, "buzz", ...] where the ith token (1-indexed) of the series is:

  • "fizzbuzz" if i is divisible by 3 and 5,
  • "fizz" if i is divisible by 3 and not 5,
  • "buzz" if i is divisible by 5 and not 3, or
  • i if i is not divisible by 3 or 5.

Implement the FizzBuzz class:

  • FizzBuzz(int n) Initializes the object with the number n that represents the length of the sequence that should be printed.
  • void fizz(printFizz) Calls printFizz to output "fizz".
  • void buzz(printBuzz) Calls printBuzz to output "buzz".
  • void fizzbuzz(printFizzBuzz) Calls printFizzBuzz to output "fizzbuzz".
  • void number(printNumber) Calls printnumber to output the numbers.

Example 1:

Input: n = 15
Output: [1,2,"fizz",4,"buzz","fizz",7,8,"fizz","buzz",11,"fizz",13,14,"fizzbuzz"]

Example 2:

Input: n = 5
Output: [1,2,"fizz",4,"buzz"]

Constraints:

  • 1 <= n <= 50

题解:

User synchronized method.

For the current number, when it fulfills the condition, print. Otherwise, wait.

Time Complexity: O(1).

Space: O(1).

AC Java:

 1 class FizzBuzz {
 2     private int n;
 3     private int cur;
 4 
 5     public FizzBuzz(int n) {
 6         this.n = n;
 7         this.cur = 1;
 8     }
 9 
10     // printFizz.run() outputs "fizz".
11     public synchronized void fizz(Runnable printFizz) throws InterruptedException {
12         while(cur <= n){
13             if(cur % 3 == 0 && cur % 5 != 0){
14                 printFizz.run();
15                 cur++;
16                 notifyAll();
17             }else{
18                 wait();
19             }
20         }
21     }
22 
23     // printBuzz.run() outputs "buzz".
24     public synchronized void buzz(Runnable printBuzz) throws InterruptedException {
25         while(cur <= n){
26             if(cur % 3 != 0 && cur % 5 == 0){
27                 printBuzz.run();
28                 cur++;
29                 notifyAll();
30             }else{
31                 wait();
32             }
33         }
34     }
35 
36     // printFizzBuzz.run() outputs "fizzbuzz".
37     public synchronized void fizzbuzz(Runnable printFizzBuzz) throws InterruptedException {
38         while(cur <= n){
39             if(cur % 3 == 0 && cur % 5 == 0){
40                 printFizzBuzz.run();
41                 cur++;
42                 notifyAll();
43             }else{
44                 wait();
45             }
46         }
47     }
48 
49     // printNumber.accept(x) outputs "x", where x is an integer.
50     public synchronized void number(IntConsumer printNumber) throws InterruptedException {
51         while(cur <= n){
52             if(cur % 3 != 0 && cur % 5 != 0){
53                 printNumber.accept(cur);
54                 cur++;
55                 notifyAll();
56             }else{
57                 wait();
58             }
59         }
60     }
61 }

类似Fizz Buzz.

标签:word,fizzbuzz,Buzz,1195,FizzBuzz,buzz,output,LeetCode,fizz
From: https://www.cnblogs.com/Dylan-Java-NYC/p/16779049.html

相关文章

  • leetcode-394.字符串解码
    394.字符串解码publicStringdecodeString(Strings){Stack<Character>stack=newStack<>();for(charc:s.toCharArray()){if(c......
  • leetcode 785. Is Graph Bipartite判断二分图 (中等)
    一、题目大意存在一个无向图,图中有n个节点。其中每个节点都有一个介于0到n-1之间的唯一编号。给你一个二维数组graph,其中graph[u]是一个节点数组,由节点u......
  • Leetcode 33 -- 二分查找&&归约思想
    题目描述搜索旋转排序数组思路思路来源一个清晰的思路:这道题和平常二分法查找的不同就在于,把一个有序递增的数组分成了,两个递增的数组,我们需要做的就是判断这个......
  • leetcode-128. 最长连续序列
    128.最长连续序列首先去重,直接把数组装入set集合即可然后,设集合中的某个数为a。遍历集合set假如这个集合中,存在a-1,说明a不是一个序列的起始值,跳过如果不存在a......
  • [LeetCode] 1328. Break a Palindrome
    GivenapalindromicstringoflowercaseEnglishletters palindrome,replace exactlyone characterwithanylowercaseEnglishlettersothattheresultingst......
  • LeetCode算法笔记 350. 两个数组的交集 II
    importjunit.framework.TestCase;importjava.util.Arrays;importjava.util.HashMap;publicclassLeetCode03extendsTestCase{/***350.两个数组......
  • Leetcode 11 -- 贪心
    题目描述最小字典许思路思路来源由于t中的字符后进先出,可以使用一个暂存栈来保存s删除的第一个字符入栈很简单,初始状态下,栈为空,我们可以直接入栈,因此,每次遍历我们......
  • leetCode 27. Remove Element
    [27.RemoveElement][(https://leetcode.cn/problems/remove-element/)思路数组在内存中是连续的,根据此题要求不能删除,而是覆盖暴力解法此题暴力解法是两层for......
  • leetcode-287. 寻找重复数-数组构成的链表
    287.寻找重复数由题中数字都在[1,n]范围内(包括1和n),可知至少存在一个重复的整数。维护一个映射关系f(n)=index->num,其中数组的下标index,数字为num当一......
  • leetcode349.两个数组的交集
    1.题目描述给定两个数组nums1和nums2,返回它们的交集。输出结果中的每个元素一定是唯一的。我们可以不考虑输出结果的顺序。2.示例示例1:输入:nums1=[1,2,2,......