mirror of
				https://git.wolves.top/wolves/leetcode.git
				synced 2025-11-04 09:16:32 +08:00 
			
		
		
		
	
		
			
				
	
	
		
			22 lines
		
	
	
		
			398 B
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			22 lines
		
	
	
		
			398 B
		
	
	
	
		
			C++
		
	
	
	
	
	
#include <vector>
 | 
						|
#include<stack>
 | 
						|
using namespace std;
 | 
						|
 | 
						|
bool test1(vector<int> array){
 | 
						|
    stack<int> S;
 | 
						|
    for (int i = 0; i < array.size()/2; i++)
 | 
						|
    {
 | 
						|
        S.push(array[i]);
 | 
						|
    }
 | 
						|
    int tag = array.size()%2;
 | 
						|
    for(int i = array.size()/2 + tag;i<array.size();i++){
 | 
						|
        if (S.top() != array[i])
 | 
						|
        {
 | 
						|
            return false;
 | 
						|
        }
 | 
						|
        S.pop();
 | 
						|
    }
 | 
						|
    return true;
 | 
						|
}
 | 
						|
 |