-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathAlternatePrintString.java
More file actions
173 lines (139 loc) · 5.14 KB
/
AlternatePrintString.java
File metadata and controls
173 lines (139 loc) · 5.14 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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
package multithreading;
/**
* @Author: Wenhang Chen
* @Description:编写一个可以从 1 到 n 输出代表这个数字的字符串的程序,但是:
* <p>
* 如果这个数字可以被 3 整除,输出 "fizz"。
* 如果这个数字可以被 5 整除,输出 "buzz"。
* 如果这个数字可以同时被 3 和 5 整除,输出 "fizzbuzz"。
* 例如,当 n = 15,输出: 1, 2, fizz, 4, buzz, fizz, 7, 8, fizz, buzz, 11, fizz, 13, 14, fizzbuzz。
* <p>
* 假设有这么一个类:
* <p>
* class FizzBuzz {
* public FizzBuzz(int n) { ... } // constructor
* public void fizz(printFizz) { ... } // only output "fizz"
* public void buzz(printBuzz) { ... } // only output "buzz"
* public void fizzbuzz(printFizzBuzz) { ... } // only output "fizzbuzz"
* public void number(printNumber) { ... } // only output the numbers
* }
* 请你实现一个有四个线程的多线程版 FizzBuzz, 同一个 FizzBuzz 实例会被如下四个线程使用:
* <p>
* 线程A将调用 fizz() 来判断是否能被 3 整除,如果可以,则输出 fizz。
* 线程B将调用 buzz() 来判断是否能被 5 整除,如果可以,则输出 buzz。
* 线程C将调用 fizzbuzz() 来判断是否同时能被 3 和 5 整除,如果可以,则输出 fizzbuzz。
* 线程D将调用 number() 来实现输出既不能被 3 整除也不能被 5 整除的数字。
* @Date: Created in 8:45 4/7/2020
* @Modified by:
*/
public class AlternatePrintString {
private static int state = 1;
private static final Object lock = new Object();
static class Task1 implements Runnable {
private int max_value;
public Task1(int max_value) {
this.max_value = max_value;
}
@Override
public void run() {
while (state <= max_value) {
synchronized (lock) {
while ((state % 3 != 0 || state % 5 != 0) && state <= max_value) {
try {
lock.wait();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
if (state <= max_value) {
System.out.println("fizzbuzz");
state++;
}
lock.notifyAll();
}
}
}
}
static class Task2 implements Runnable {
private int max_value;
public Task2(int max_value) {
this.max_value = max_value;
}
@Override
public void run() {
while (state <= max_value) {
synchronized (lock) {
while ((state % 3 != 0 || state % 5 == 0) && state <= max_value) {
try {
lock.wait();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
if (state <= max_value) {
System.out.println("fizz");
state++;
}
lock.notifyAll();
}
}
}
}
static class Task3 implements Runnable {
private int max_value;
public Task3(int max_value) {
this.max_value = max_value;
}
@Override
public void run() {
while (state <= max_value) {
synchronized (lock) {
while ((state % 3 == 0 || state % 5 != 0) && state <= max_value) {
try {
lock.wait();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
if (state <= max_value) {
System.out.println("buzz");
state++;
}
lock.notifyAll();
}
}
}
}
static class Task4 implements Runnable {
private int max_value;
public Task4(int max_value) {
this.max_value = max_value;
}
@Override
public void run() {
while (state <= max_value) {
synchronized (lock) {
while ((state % 3 == 0 || state % 5 == 0) && state <= max_value) {
try {
lock.wait();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
if (state <= max_value) {
System.out.println(state);
state++;
}
lock.notifyAll();
}
}
}
}
public static void main(String[] args) {
int n = 15;
new Thread(new Task1(n)).start();
new Thread(new Task2(n)).start();
new Thread(new Task3(n)).start();
new Thread(new Task4(n)).start();
}
}