【Leetcode Algorithm】Min Stack

来源：互联网发布：ubuntu xorg 安装编辑：程序博客网时间：2024/06/05 02:02

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

push(x) -- Push element x onto stack.
pop() -- Removes the element on top of the stack.
top() -- Get the top element.
getMin() -- Retrieve the minimum element in the stack.

public class Solution {    public int[] plusOne(int[] digits) {        //从个位开始加1，如果产生进位直接置为0，没有进位则，跳出循环        for(int i=digits.length-1;i>=0;i--){            if((digits[i] += 1)==10){                digits[i] = 0;            }            else{                break;            }        }        //如果最高位为0，说明产生进位，则数组加长，首位为1        if(digits[0]==0){            int[] newDigits = new int[digits.length+1];            newDigits[0] = 1;            digits = newDigits;        }        return digits;    }}

0 0