New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[C++] BOJ10845 (Stack) #14

Open

Settpark opened this issue Sep 23, 2021 · 0 comments

Assignees

Labels

Owner

Settpark commented Sep 23, 2021

스택의 구현

크게 어려운 부분은 없었으나

    int MX = 1000005;
    int data[MX];
    
    int head = 0, tail = 0;

    if (command == "back") {
        if (tail - head != 0) cout << data[tail-1] << '\n';
        else cout << -1 << '\n';
    }

가장 마지막 원소에 접근할 때는 tail-1이다!
tail은 항상 마지막 원소 다음을 가리키고 있기 때문에 값이 비어있다. (혹은 쓰레기값이 들어있지렁이)

Settpark added Algorithm C++ labels

Settpark self-assigned this

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment