UVA514 栈 java

打开题的时候发现19年11月做过，那时候还大一上，现在转眼要大二下了

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;

public class UVA514 {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        while(true){
            int n=sc.nextInt();
            if(n==0)break;

            while (true){
                Stack<Integer> stack=new Stack<>();
                Queue<Integer> queue=new LinkedList<>();
                for (int i = 1; i <= n; i++) {
                    queue.offer(i);
                }
                boolean flag=true;
                int[] a=new int[n];
                for (int i = 0; i < n; i++) {
                    a[i]=sc.nextInt();
                    if(a[0]==0){
                        flag=false;
                        break;
                    }
                }
                if(!flag)break;
                int k=0;
                while(!queue.isEmpty()){
                    int tmp=queue.poll();
                    stack.push(tmp);
                    while(tmp==a[k]){
                        stack.pop();
                        k++;
                        if(!stack.isEmpty())tmp=stack.peek();
                        else break;
                    }
                }
                if(stack.isEmpty()) System.out.println("Yes");
                else System.out.println("No");
            }
            System.out.println();
        }

    }
}

现在看当时的代码感觉蛮有意思的，也附上了哈，纪念一下

#include<stdio.h>
#include<stack>
using namespace std;
int main()
{
	int n,a[1050],i,m;
	while(scanf("%d",&n)!=EOF&&n)
	{
		while(scanf("%d",&a[0])!=EOF&&a[0])
		{
			stack<int>k;
			for(i=1;i<n;i++)
			scanf("%d",&a[i]);
			for(i=1,m=0;i<=n;i++)
			{k.push(i);
			while(k.top()==a[m]) 
			
			{
			{if(!k.empty())
			{k.pop();
			m++;
			}
			if(k.empty())
			break;
			
			}
			}}
		
		
		if(m==n)
		printf("Yes\n");
		else
		printf("No\n");}
		printf("\n");
		
			
		
	}return 0;
}