Skip to content

Commit aba71b0

Browse files
committed
feat: update solutions to leetcode problem: No.0232
1 parent 828256e commit aba71b0

File tree

3 files changed

+9
-12
lines changed

3 files changed

+9
-12
lines changed

solution/0200-0299/0232.Implement Queue using Stacks/README.md

+3-4
Original file line numberDiff line numberDiff line change
@@ -106,13 +106,12 @@ class MyQueue:
106106
```java
107107
class MyQueue {
108108

109-
private Deque<Integer> s1;
110-
private Deque<Integer> s2;
109+
private Deque<Integer> s1 = new ArrayDeque<>();
110+
private Deque<Integer> s2 = new ArrayDeque<>();
111111

112112
/** Initialize your data structure here. */
113113
public MyQueue() {
114-
s1 = new ArrayDeque<>();
115-
s2 = new ArrayDeque<>();
114+
116115
}
117116

118117
/** Push element x to the back of queue. */

solution/0200-0299/0232.Implement Queue using Stacks/README_EN.md

+3-4
Original file line numberDiff line numberDiff line change
@@ -107,13 +107,12 @@ class MyQueue:
107107
```java
108108
class MyQueue {
109109

110-
private Deque<Integer> s1;
111-
private Deque<Integer> s2;
110+
private Deque<Integer> s1 = new ArrayDeque<>();
111+
private Deque<Integer> s2 = new ArrayDeque<>();
112112

113113
/** Initialize your data structure here. */
114114
public MyQueue() {
115-
s1 = new ArrayDeque<>();
116-
s2 = new ArrayDeque<>();
115+
117116
}
118117

119118
/** Push element x to the back of queue. */

solution/0200-0299/0232.Implement Queue using Stacks/Solution.java

+3-4
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,11 @@
11
class MyQueue {
22

3-
private Deque<Integer> s1;
4-
private Deque<Integer> s2;
3+
private Deque<Integer> s1 = new ArrayDeque<>();
4+
private Deque<Integer> s2 = new ArrayDeque<>();
55

66
/** Initialize your data structure here. */
77
public MyQueue() {
8-
s1 = new ArrayDeque<>();
9-
s2 = new ArrayDeque<>();
8+
109
}
1110

1211
/** Push element x to the back of queue. */

0 commit comments

Comments
 (0)