Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include "ArrayList.h"
- using namespace std;
- void ArrayList::LInsert(const LData &data)
- {
- if (numOfData > LIST_LEN) {
- cout << "저장이 불가능합니다" << endl;
- return;
- }
- arr[numOfData] = data;
- numOfData++;
- }
- bool ArrayList::LFirst(LData &data)
- {
- if (numOfData == 0)
- return false;
- curPosition = 0;
- data = arr[0];
- return true;
- }
- bool ArrayList::LNext(LData &data)
- {
- if (curPosition >= numOfData - 1)
- return false;
- curPosition++;
- data = arr[curPosition];
- return true;
- }
- LData ArrayList::LRemove()
- {
- int rpos = curPosition;
- int num = numOfData;
- LData rdata = arr[rpos];
- for (int i = rpos; i < num - 1; i++) {
- arr[i] = arr[i + 1];
- }
- numOfData--;
- curPosition--;
- return rdata;
- }
- int ArrayList::LCount()
- {
- return numOfData;
- }
Add Comment
Please, Sign In to add comment