| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 8 | 9 | 10 | 11 | 12 | 13 | 14 |
| 15 | 16 | 17 | 18 | 19 | 20 | 21 |
| 22 | 23 | 24 | 25 | 26 | 27 | 28 |
| 29 | 30 | 31 |
Tags
- #bubbleSort
- html5 new tag
- #C++ has~a
- #C++ 연산자함수오버로딩
- #CallByAddress
- html multimedia
- #2차원배열
- #자바상속#자바이즈어#is~a
- docker example
- 하이퍼레저패브릭
- html plug-in
- git flow
- #다차원포인터
- html id
- hyperledger transaction
- #3차원배열
- relative path
- mac terminal command
- #android activity
- #성적관리프로그램
- #binary
- #JAVASCRIPT
- 토큰경제
- html youtube
- html charset
- border-box
- html code
- #1차원배열
- html object
- html video
Archives
- Today
- Total
목록#스택 (1)
A sentimental robot
Stack
#include int Push(struct Stack* s, int data); int Pop(struct Stack* s, int* data); struct Stack { int data[5]; int top; }; int Push(struct Stack*s, int data){ if(s->top>=5) return 0; s->data[s->top++]=data; /* s->data[s->top]=data; s->top++; */ return 1; } int Pop(struct Stack *s, int *data){ /* s->top--; *data=s->data[s->top]; */ *data=s->data[--s->top]; return 1; } void main() { Stack s = {0};..
Data Structure
2018. 1. 3. 13:23