双端队列实现链表的倒序

示例 1：

输入：head = [1,3,2] //链表
输出：[2,3,1]

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] reversePrint(ListNode head) {
		//双端队列初始化
        Deque<Integer> dq = new LinkedList<>();

        ListNode p = head;//相当于新建了链表指针
        int len=0;

        while(p!=null){//判是否为空即可
            //添加到队头
            dq.offerFirst(p.val);
            len++;
            p = p.next;
        }
        int[] nums=new int[len];

        for(int i = 0;i < len ;i++){
            nums[i] = dq.peekFirst();//读取队头
            dq.removeFirst();//弹出队头
        } 



         return nums;    

    }
}

剑指 Offer 30. 包含min函数的栈

class MinStack {

    /***
    这里使用双端队列实现栈结构
    利用辅助栈
     */

    /** initialize your data structure here. */
    Deque<Integer> dq;
    Deque<Integer> mindq;
    public MinStack() {
        dq = new LinkedList<>();
        mindq = new LinkedList<>();
    }
    
    public void push(int x) {
        dq.push(x);
        if(mindq.isEmpty()||x<=mindq.peek()){
            mindq.push(x);
        }

    }
    
    public void pop() {
        /***
        dq.pop() == mindq.peek() 并不能成功让dq pop
         */
        if(dq.pop().equals(mindq.peek())){
            mindq.pop();
        }
        
 
        
    }
    
    public int top() {
        return dq.peek();
    }
    
    public int min() {
        return mindq.peek();
    }
}

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack obj = new MinStack();
 * obj.push(x);
 * obj.pop();
 * int param_3 = obj.top();
 * int param_4 = obj.min();
 */