#include "stdafx.h"
#include "SingleList.h"
#include <cstdlib>
#include <iostream>
#include <string.h>
#include <conio.h>
#include <stdio.h>

/*c++實現(xiàn)簡單的單鏈表操作*/
using namespace std;

SingleList::SingleList()
{
  int num;
  char name[128];

  // 創(chuàng)建鏈表
  node *stuList = CreatNode();
  PrintList(stuList);

  // 插入節(jié)點
  printf("\n請輸入要插入的學生學號和姓名，輸入0 0表示結(jié)束.");
  scanf_s("%d%s", &num, name, 100);
  stuList = InsertNode(stuList, num, name);
  PrintList(stuList);

  // 刪除節(jié)點
  printf("\n請輸入要刪除的學生學號：");
  scanf_s("%d", &num, 100);
  stuList = DeleteNode(stuList, num);
  PrintList(stuList);

  // 逆序
  printf("\n逆序后的鏈表為：\n");
  stuList = ReverseList(stuList);
  PrintList(stuList);

  system("PAUSE");
}


SingleList::~SingleList()
{
}

//建立單鏈表 
node *SingleList::CreatNode()
{
  node *head, *p, *s;

  int num = 0;
  char name[128];
  int cycle = 1;

  head = (node *)malloc(sizeof(node));  // 為頭結(jié)點分配內(nèi)存空間
  head->next = nullptr;
  p = head;    // p指向頭節(jié)點

  while (cycle)
  {
    printf("\n請輸入學生的學號和姓名:");
    scanf_s("%d%s", &num, name, 100);

    if (num != 0)
    {
      s = (node *)malloc(sizeof(node));
      s->num = num;
      memcpy(s->name, name, 128);
      printf("%d%s", s->num, s->name);
      p->next = s;    // 指向新插入的節(jié)點
      p = s;    // p指向當前節(jié)點
    }
    else
    {
      cycle = 0;
    }
  }

  head = head->next;
  p->next = NULL;
  printf("頭節(jié)點學生信息為: %d%s\n", head->num, head->name);

  return head;
}

//單鏈表插入
node *SingleList::InsertNode(node *head, int num, char* name)
{
  node *s, *p1, *p2 = NULL;

  p1 = head;
  s = (node *)malloc(sizeof(node));
  s->num = num;
  strcpy_s(s->name, name);

  while ((s->num > p1->num) && p1->next != NULL)
  {
    p2 = p1;
    p1 = p1->next;
  }

  if (s->num <= p1->num)
  {
    if (head == p1)
    {
      // 插入首節(jié)點
      s->next = p1;
      head = s;
    }
    else
    {
      // 插入中間節(jié)點
      p2->next = s;
      s->next = p1;
    }
  }
  else
  {
    // 插入尾節(jié)點
    p1->next = s;
    s->next = NULL;
  }

  return head;
}

// 計算單鏈表長度
int SingleList::GetLength(node *head)
{
  int length = 0;
  node *p;
  p = head;

  while (p != NULL)
  {
    p = p->next;
    length++;
  }
  return length;
}

//單鏈表刪除某個元素 
node *SingleList::DeleteNode(node *head, int num)
{
  node *p1, *p2 = nullptr;
  p1 = head;

  while (num != p1->num && p1->next != NULL)
  {
    p2 = p1;
    p1 = p1->next;
  }

  if (num == p1->num)
  {
    if (p1 == head)
    {
      head = p1->next;
    }
    else
    {
      p2->next = p1->next;
    }
    free(p1);
  }
  else
  {
    printf("找不到學號為%d 的學生!\n", num);
  }
  return head;

}

//單鏈表逆序
node *SingleList::ReverseList(node *head)
{
  // A->B->C->D
  node *old_head;    // 原來鏈表的頭
  node *new_head;    // 新鏈表的頭
  node *cur_head;    // 獲得原來鏈表的頭

  if (head == NULL || head->next == NULL)
    return head;

  new_head = head;        // A
  cur_head = head->next;    // B
  while (cur_head)
  {
    old_head = cur_head->next;    // 將原來鏈表的頭取出，并將第二個節(jié)點作為頭節(jié)點
    cur_head->next = new_head;  // 將取出的頭設為新鏈表的頭
    new_head = cur_head;        // 新鏈表的頭就是目前新鏈表的頭
    cur_head = old_head;          // 接著處理
  }
  head->next = NULL;
  head = new_head;
  return head;
}

//打印單鏈表
void SingleList::PrintList(node *head)
{
  node *p;
  int n;
  n = GetLength(head);
  printf("\n打印出 %d 個學生的信息:\n", n);

  p = head;
  while (p != NULL)
  {
    printf("學號： %d ，姓名： %s\n", p->num, p->name);
    p = p->next;
  }
}

#pragma once
typedef struct student
{
  int num;        // 學號
  char name[128]; // 姓名
  struct student *next;
}node;

class SingleList
{
public:
  SingleList();
  ~SingleList();

  //建立單鏈表 
  node *CreatNode();
  //單鏈表插入
  node *InsertNode(node *head, int num, char* name);
  // 計算單鏈表長度
  int GetLength(node *head);
  //單鏈表刪除某個元素 
  node *DeleteNode(node *head, int num);
  //單鏈表逆序
  node *ReverseList(node *head);
  //打印單鏈表
  void PrintList(node *head);

};