#include<iostream>
#ifndef SqList_H_
#define SqList_H_
#define initSize 100
#define increment 10
typedef int ElemType;
class SqList
{
private:
ElemType* elem;
int length;
int listsize;
public:
SqList();
bool isFull()const;
bool isEmpty()const;
~SqList();
ElemType getElem(int)const;
bool insert(int, ElemType);
bool insert(ElemType);
void create();
void merge(SqList&, SqList&);
bool del(int);
void displayem();
};
#endif
#ifndef DYNAMIC_ARRAY_H
#define DYNAMIC_ARRAY_H
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct DYNAMICARRAY {
int* pAddr;
int size;
int capacity;
}Dynamic_Array;
Dynamic_Array* Init_Array();
void Push_Back_Array(Dynamic_Array* arr, int value);
void RemoveByPos_Array(Dynamic_Array* arr, int pos);
void RemoveByValue_Array(Dynamic_Array* arr, int value);
int Find_Array(Dynamic_Array* arr);
void Print_Array(Dynamic_Array* arr);
void FreeSpace_Array(Dynamic_Array* arr);
void Clear_Array(Dynamic_Array* arr);
int Capacity_Array(Dynamic_Array* arr);
int Size_Array(Dynamic_Array* arr);
int At_Array(Dynamic_Array* arr, int pos);
#endif
#include"DynamicArray.h"
Dynamic_Array* Init_Array() {
Dynamic_Array* myArray = (Dynamic_Array*)malloc(sizeof(Dynamic_Array));
myArray->size = 0;
myArray->capacity = 20;
myArray->pAddr = malloc(sizeof(int) * myArray->capacity);
return myArray;
}
void Push_Back_Array(Dynamic_Array* arr, int value) {
if (arr == NULL) {
return;
}
if (arr->size==arr->capacity) {
int* newSpace = malloc(sizeof(int) * arr->capacity * 2);
memcpy(newSpace, arr->pAddr, arr->capacity * sizeof(int));
free(arr->pAddr);
arr->capacity = arr->capacity * 2;
arr->pAddr = newSpace;
}
arr->pAddr[arr->size] = value;
arr->size++;
}
void RemoveByPos_Array(Dynamic_Array* arr, int pos) {
if (arr == NULL) {
return;
}
if (pos < 0 || pos >= arr->size) {
return;
}
for (int i = pos; i < arr->size-1; i++) {
arr->pAddr[i] = arr->pAddr[i + 1];
}
arr->size--;
}
void RemoveByValue_Array(Dynamic_Array* arr, int value) {
if (arr == NULL) {
return;
}
int pos = -1;
for (int i = 0; i < arr->size; i++) {
if (arr->pAddr[i] == value) {
pos = i; break;
}
}
RemoveByPos_Array(arr, pos);
}
int Find_Array(Dynamic_Array* arr,int value) {
if (arr == NULL) {
return;
}
int pos = -1;
for (int i = 0; i < arr->size; i++) {
if (arr->pAddr[i] == value) {
pos = i; break;
}
}
return pos;
}
void FreeSpace_Array(Dynamic_Array* arr) {
if (arr == NULL) {
return;
}
for (int i = 0; i < arr->size; i++) {
printf("%d", arr->pAddr[i]);
}
printf("\n");
}
void FreeSpace_Array(Dynamic_Array* arr) {
if (arr == NULL) {
return ;
}
if (arr->pAddr != NULL) {
free(arr->pAddr);
}
free(arr);
}
void Clear_Array(Dynamic_Array* arr) {
if (arr == NULL) {
return;
}
arr->size = 0;
}
int Capacity_Array(Dynamic_Array* arr) {
if (arr == NULL) {
return -1;
}
return arr->capacity;
}
int Size_Array(Dynamic_Array* arr) {
if (arr == NULL) {
return -1;
}
return arr->size;
}
int At_Array(Dynamic_Array* arr, int pos) {
if (arr == NULL) {
return -1;
}
return arr->pAddr[pos];
}
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
template<class datatype>
class node;
template<class datatype>
class LinkList
{
private:
int len;
node<datatype>* head;
public:
LinkList();
LinkList(datatype x, int n);
datatype GetElem(int n);
int FindElem(datatype value);
void topinsert(datatype value);
void backinsert(datatype value);
datatype getNthFromEnd(int n);
void removeNthFromEnd(int n);
void removeNthFromStart(int n);
void sortLink1();
void sortLink2();
node<datatype>* mergesort(node<datatype>* node1);
node<datatype>* merge(node<datatype>* l1, node<datatype>* l2);
void reverseList();
bool judgeequal(LinkList& a);
int getlen()
{
return len;
};
friend ostream& operator<<(ostream& output, const LinkList& D)
{
if (D.len == 0)
{
cout << "LinkList is empty" << endl;
exit(1);
}
node<datatype>* p = D.head->next;
for (int i = 1; i <= D.len; i++)
{
output << p->val << ' ';
p = p->next;
}
cout << endl;
return output;
}
~LinkList();
};
template<class datatype>
class node
{
node() {};
friend class LinkList<datatype>;
public:
datatype val;
node<datatype>* next;
node(datatype x) : val(x), next(NULL) {};
};
template<class datatype>
LinkList<datatype>::LinkList()
{
head = new node<datatype>;
len = 0;
head->next = NULL;
}
template<class datatype>
LinkList<datatype>::LinkList(datatype x, int n)
{
head = new node<datatype>;
len = n;
head->next = NULL;
node<datatype>* p = head;
for (int i = 0; i < n; i++)
{
p->next = new node<datatype>(x);
p = p->next;
}
}
template<class datatype>
LinkList<datatype>::~LinkList()
{
node<datatype>* p1 = head, * p2;
while (p1 != NULL)
{
p2 = p1->next;
delete p1;
p1 = p2;
}
}
template<class datatype>
datatype LinkList<datatype>::GetElem(int n)
{
if (n > len || n < 1)
{
cerr << "取值有误";
return -1;
}
else
{
node<datatype>* p = head;
for (int i = 0; i < n; i++)
{
p = p->next;
}
datatype value = p->val;
return value;
}
}
template<class datatype>
int LinkList<datatype>::FindElem(datatype value)
{
node<datatype>* p = head->next;
int pos = 1;
while (p)
{
if (p->val == value)
return pos;
else
{
p = p->next;
pos++;
}
}
return -1;
}
template<class datatype>
void LinkList<datatype>::topinsert(datatype value)
{
node<datatype>* p = new node<datatype>(value);
node<datatype>* k = head->next;
head->next = p;
p->next = k;
len++;
}
template<class datatype>
void LinkList<datatype>::backinsert(datatype value)
{
node<datatype>* p = head;
for (int i = 0; i < len; i++)
{
p = p->next;
}
p->next = new node<datatype>(value);
len++;
}
template<class datatype>
datatype LinkList<datatype>::getNthFromEnd(int n)
{
if (n > len || n < 0)
{
cerr << "取值有误";
return -1;
}
else if (n == len)
return head->next->val;
else
{
node<datatype>* p = head->next;
for (int i = 0; i < len - n; i++)
{
p = p->next;
}
return p->val;
}
}
template<class datatype>
void LinkList<datatype>::removeNthFromEnd(int n)
{
if (n > len || n < 0)
{
cerr << "取值有误" << endl;
}
else
{
if (n == len)
{
node<datatype>* p = head->next;
head->next = head->next->next;
delete p;
}
else if (n == 1)
{
node<datatype>* p = head->next;
for (int i = 1; i < len - 1; i++)
{
p = p->next;
}
node<datatype>* k = p->next;
p->next = NULL;
delete k;
}
else
{
node<datatype>* p = head;
for (int i = 0; i < len - n; i++)
{
p = p->next;
}
node<datatype>* k = p->next;
p->next = p->next->next;
delete k;
}
len--;
}
}
template<class datatype>
void LinkList<datatype>::removeNthFromStart(int n)
{
if (n<0 || n>len)
cerr << "取值有误" << endl;
else
{
if (n == 1)
{
node<datatype>* p = head->next;
head->next = head->next->next;
delete p;
}
else if (n == len)
{
node<datatype>* p = head->next;
for (int i = 1; i < len - 1; i++)
{
p = p->next;
}
node<datatype>* k = p->next;
p->next = NULL;
delete k;
}
else
{
node<datatype>* p = head;
for (int i = 0; i < n - 1; i++)
{
p = p->next;
}
node<datatype>* k = p->next;
p->next = p->next->next;
delete k;
}
len--;
}
}
template<class datatype>
void LinkList<datatype>::reverseList()
{
if (!(head == NULL || head->next == NULL))
{
node<datatype>* p = head->next;
node<datatype>* k = p->next;
head->next->next = NULL;
head->next = NULL;
while (k)
{
node<datatype>* temp = k->next;
k->next = p;
p = k;
k = temp;
}
head->next = p;
}
}
template<class datatype>
void LinkList<datatype>::sortLink1()
{
vector<datatype> temp;
node<datatype>* p = head->next;
for (int i = 0; i < len; i++)
{
temp.push_back(p->val);
p = p->next;
}
sort(temp.begin(), temp.end());
p = head->next;
for (int i = 0; i < len; i++)
{
p->val = temp[i];
p = p->next;
}
}
template<class datatype>
void LinkList<datatype>::sortLink2()
{
head->next = mergesort(head->next);
}
template<class datatype>
node<datatype>* LinkList<datatype>::mergesort(node<datatype>* node1)
{
if (!node1 || !node1->next) return node1;
node<datatype>* fast = node1;
node<datatype>* slow = node1;
node<datatype>* brek = node1;
while (fast && fast->next)
{
fast = fast->next->next;
brek = slow;
slow = slow->next;
}
brek->next = nullptr;
node<datatype>* l1 = mergesort(node1);
node<datatype>* l2 = mergesort(slow);
return merge(l1, l2);
}
template<class datatype>
node<datatype>* LinkList<datatype>::merge(node<datatype>* l1, node<datatype>* l2)
{
if (l1 == NULL)
{
return l2;
}
if (l2 == NULL)
{
return l1;
}
if (l1->val < l2->val)
{
l1->next = merge(l1->next, l2);
return l1;
}
else
{
l2->next = merge(l2->next, l1);
return l2;
}
}
template<class datatype>
bool LinkList<datatype>::judgeequal(LinkList& a)
{
if (a.getlen() != len)
return false;
else
{
node<datatype>* q = a.head->next;
node<datatype>* k = head->next;
for (int i = 0; i < len; i++)
{
if (q->val != k->val)
return false;
q = q->next;
k = k->next;
}
return true;
}
}
int main()
{
LinkList<int> A;
LinkList<int> B;
A.backinsert(2);
A.backinsert(3);
A.backinsert(1);
A.backinsert(1);
B.backinsert(2);
B.backinsert(3);
B.backinsert(1);
B.backinsert(1);
cout << "此时链表A元素有:" << A;
cout << "此时的链表A长度为" << A.getlen() << endl;
cout << "此时链表A的倒数第二个元素为" << A.getNthFromEnd(2) << endl;
cout << "此时链表B元素有:" << B;
cout << A;
if (A.judgeequal(B))
cout << "两个链表相等" << endl;
else cout << "两个链表不相等" << endl;
if (A.FindElem(3) != -1)
{
cout << "找到该元素,在第" << A.FindElem(3) << "个位置" << endl;
}
else cout << "未找到该元素" << endl;
if (A.FindElem(1) != -1)
{
cout << "找到该元素,在第" << A.FindElem(1) << "个位置" << endl;
}
else cout << "未找到该元素" << endl;
system("pause");
return 0;
}