[백준 5397] 키로커

https://www.acmicpc.net/problem/5397

5397번: 키로거

 

요구사항

1. 리스트 구현

 - 리스트를 구현하여 조건에 맞게 문자를 삽입, 삭제, 커서 이동을 실행 시켜 준다.

 

#include <iostream>
#include <string.h>
#include <string>

using namespace std;

const int SIZE = 987654321;

struct Node{
	int prev;
	int next;
	char data;
};

struct List{
	int HEAD = SIZE;
	int TAIL = SIZE+1;
	int pos=0;
	int size=0;
	Node node[SIZE+2];
	List(){
		pos=0;
		node[HEAD].next=TAIL;
		node[TAIL].prev=HEAD;
	}
	
	void push_back(char data)
	{
		int prev = node[TAIL].prev;
		int next = node[prev].next;
		node[pos].data=data;
		
		node[pos].next=next;
		node[next].prev=pos;
		
		node[pos].prev=prev;
		node[prev].next=pos;
		pos++;
			
	}
	
	void push_front(char data)
	{
		int next= node[HEAD].next;
		int prev= node[next].prev;
		
		node[pos].data=data;
		
		node[pos].next=next;
		node[next].prev=pos;
		
		node[pos].prev=prev;
		node[prev].next=pos;
		pos++;
		size--;
		
	}
	
	void pop_front()
	{
		int target = node[HEAD].next;
		
		
		int next= node[target].next;
		int prev= node[target].prev;
		
		node[next].prev= prev;
		node[prev].next= next;
		
		
		size--;
		
	}
	
	void pop_back()
	{
		int target = node[TAIL].prev;
		
		
		int next= node[target].next;
		int prev= node[target].prev;
		
		node[next].prev= prev;
		node[prev].next= next;
		
		
		size--;
		
	}
	void show(int p)
	{
		int target= node[HEAD].next;
		for(int i=0 ; i < p ; i++)
		{
			printf("%c",node[target].data);
			target=node[target].next;
		}
	}
	
	void erase(int p)
	{
		int target= node[HEAD].next;
		for(int i=0 ; i < p ; i++)
		{
			target=node[target].next;
		}
		int next = node[target].next;
		int prev = node[target].prev;
		
		node[next].prev = prev;
		node[prev].next= next;
		size--;
	}
	
	
	
	void insert(int p, char data)
	{
		int next= node[HEAD].next;
		for(int i=0 ; i < p ; i++)
		{
			next=node[next].next;
		}
		int prev = node[next].prev;
		
		node[pos].data=data;
		
		node[pos].prev = prev;
		node[prev].next= pos;
		
		node[pos].next = next;
        node[next].prev = pos;
        ++pos;
        size++;
		
	}
};

List mylist;
int main()
{
	
	int n;
	scanf("%d",&n);
	
	for(int i=0 ; i < n ; i++)
	{
		List mylist;
		string str;
		int mypos=0;
		cin>>str;
		int s= str.size();
		for(int j=0 ; j <s ; j++)
		{
			if(str[j] =='<')
			{
				if(mypos ==0)
					continue;
				else
					mypos--;
			}
			else if(str[j] =='>')
			{
				if(mylist.size == mypos)
					continue;
				else
					mypos++;
			}
			else if(str[j] =='-')
			{
				if(mylist.size != 0)
					mylist.erase(mypos);
			}
			else
			{
				mylist.insert(mypos,str[j]);
				mypos++;
			}
			
		}
		mylist.show(mylist.size);
		printf("\n");
		
	}
}