Skip to content

Update Python, Java, Go, Kotlin / 0155-minimum-stack.md #3934

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update Python, Java, Go, Kotlin / 0155-minimum-stack.md #3934

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
34 changes: 17 additions & 17 deletions articles/minimum-stack.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -543,14 +543,14 @@ class MinStack:
self.min = float('inf')
self.stack = []

def push(self, x: int) -> None:
def push(self, val: int) -> None:
if not self.stack:
self.stack.append(0)
self.min = x
self.min = val
else:
self.stack.append(x - self.min)
if x < self.min:
self.min = x
self.stack.append(val - self.min)
if val < self.min:
self.min = val

def pop(self) -> None:
if not self.stack:
Expand Down Expand Up @@ -581,13 +581,13 @@ public class MinStack {
stack = new Stack<>();
}

public void push(int x) {
public void push(int val) {
if (stack.isEmpty()) {
stack.push(0L);
min = x;
min = val;
} else {
stack.push(x - min);
if (x < min) min = x;
stack.push(val - min);
if (val < min) min = val;
}
}

Expand Down Expand Up @@ -755,14 +755,14 @@ func Constructor() MinStack {
}
}

func (this *MinStack) Push(x int) {
func (this *MinStack) Push(val int) {
if len(this.stack) == 0 {
this.stack = append(this.stack, 0)
this.min = x
this.min = val
} else {
this.stack = append(this.stack, x - this.min)
if x < this.min {
this.min = x
this.stack = append(this.stack, val - this.min)
if val < this.min {
this.min = val
}
}
}
Expand Down Expand Up @@ -796,8 +796,8 @@ class MinStack() {
private var min: Long = Long.MAX_VALUE
private val stack = ArrayDeque<Long>()

fun push(x: Int) {
val valAsLong = x.toLong()
fun push(`val`: Int) {
val valAsLong = `val`.toLong()
if (stack.isEmpty()) {
stack.addLast(0L)
min = valAsLong
Expand Down Expand Up @@ -833,4 +833,4 @@ class MinStack() {
### Time & Space Complexity

* Time complexity: $O(1)$ for all operations.
* Space complexity: $O(n)$
* Space complexity: $O(n)$