#include <iostream>#include <stdlib.h>using namespace std;class List{public: List(); ~List(); List* createNode(int value);//創建節點 bool insertNode(List *node);//插入節點 void printList();//打印節點 bool deleteNode(List *node);//刪除節點不移動頭節點 bool deleteNode1(List *node);//刪除節點移動頭節點 int listSize();//長度 void printNode();//打印但前的value void freeList();//釋放鏈表private: int value; List *head; List *next;};bool List::deleteNode(List *node){ if (node == NULL) { std:cout << "node is NULL" << std::endl;  return false; } if (head == NULL) { std::cout << "head is NULL" << std::endl;  return false; } //如果node等于head if (head == node) { head = head->next; } List *p = head; while (p->next != NULL) { if (p->next == node) {  p->next = p->next->next;  return true; } p = p->next; } return false; }bool List::deleteNode1(List *node){ if (node == NULL) { std:cout << "node is NULL" << std::endl;  return false; } if (head == NULL) { std::cout << "head is NULL" << std::endl;  return false; } //如果node等于head if (head == node) { head = head->next; } List *p = head; while (head->next != NULL) { if (head->next == node) {  head->next = head->next->next;  std::cout << "delete node success head->value" << head->value << std::endl;  //這里要記得把頭節點的指針移動最后還原,這里的頭節點是保存在這個類里面,改變了就是改變了  //如果這里是把head作為參數傳遞,最后head會被銷毀那么不需要移動頭指針  head = p;  return true; } //注意,這里由于head是成員變量,改變了就是改變了,所以需要最后重新指定 head = head->next; } std::cout << "delete node fail head->value" << head->value << std::endl; //這里要記得把頭節點的指針移動最后還原,這里的頭節點是保存在這個類里面,改變了就是改變了 //如果這里是把head作為參數傳遞,最后head會被銷毀那么不需要移動頭指針 head = p; return false; }List::List(){ value = 0; head = NULL; next = NULL;}List::~List(){ delete head; delete next;}List* List::createNode(int value){ List *list = NULL; list = new List(); if (list) { list->value = value; return list;  } return NULL;}bool List::insertNode(List *node){ node->next = head; head = node; return true; }void List::printList(){ if (head == NULL) { std::cout << "head is NULL" << std::endl; return; } List *p = head; while (p != NULL) { std::cout << p->value << std::endl;  p = p->next; } return; }void List::printNode(){ std::cout << value << std::endl; }int List::listSize(){ if (head == NULL) { std::cout << "head is NULL" << std::endl; return 0;  } int len = 0; List *p = head; while (p != NULL) { p = p->next; ++len; } return len;}void List::freeList(){ if (head == NULL) { std::cout << "head is NULL" << std::endl; return;  } List *p; while (head != NULL) { p = head; head = head->next; free(p); }}int main(){ List list; List *list1 = list.createNode(5); list.insertNode(list1); List *list2 = list.createNode(6); list.insertNode(list2); List *list3 = list.createNode(1); list.insertNode(list3); List *list4 = list.createNode(3); list.insertNode(list4); List *list5 = list.createNode(2); list.insertNode(list5); list.printList(); std::cout << "list size is " << list.listSize() << std::endl; std::cout << "-----------開始刪除節點值為3的節點" << std::endl; list.deleteNode1(list4); list.printList(); std::cout << "list size is " << list.listSize() << std::endl; list.freeList(); list.printList(); return 0; }

#include <stdio.h>void change(char *a){ *(a + 1) = 's';}int main(){ char value[10] = "chenyu"; change(value); printf("value is %s/n", value); return 0;}#include <stdio.h>void change(char *a){ char *p = a; *(p + 1) = 's';}int main(){ char value[10] = "chenyu"; change(value); printf("value is %s/n", value); return 0;}