{"id":1535,"date":"2024-06-20T10:54:22","date_gmt":"2024-06-20T02:54:22","guid":{"rendered":"https:\/\/aoofoo.com\/?p=1535"},"modified":"2025-02-20T16:19:25","modified_gmt":"2025-02-20T08:19:25","slug":"1-3-%e9%a1%ba%e5%ba%8f%e8%a1%a8%e4%b8%8e%e9%93%be%e8%a1%a8","status":"publish","type":"post","link":"https:\/\/aoofoo.com\/index.php\/2024\/06\/20\/1-3-%e9%a1%ba%e5%ba%8f%e8%a1%a8%e4%b8%8e%e9%93%be%e8%a1%a8\/","title":{"rendered":"1.3 \u987a\u5e8f\u8868\u4e0e\u94fe\u8868"},"content":{"rendered":"

\u7ebf\u6027\u8868<\/h2>\n

\u7531n\uff08n>=0\uff09\u4e2a\u6570\u636e\u7279\u6027\u76f8\u540c\u7684\u5143\u7d20\u6784\u6210\u7684\u6709\u9650\u5e8f\u5217\uff0c\u79f0\u4e3a\u7ebf\u6027\u8868\u3002\u5373\uff0c\u7ebf\u6027\u8868\u662fn\u4e2a\u6570\u636e\u5143\u7d20\u7684\u6709\u9650\u5e8f\u5217\uff0c\u5176\u4e2dn\u4e2a\u6570\u636e\u662f\u76f8\u540c\u6570\u636e\u7c7b\u578b\u7684\u3002<\/p>\n

\u5b58\u5728\u552f\u4e00\u4e00\u4e2a\u201c\u7b2c\u4e00\u4e2a\u201d\u7684\u6570\u636e\u5143\u7d20\uff08\u5934\u8282\u70b9\uff09\u3002<\/p>\n

\u5b58\u5728\u552f\u4e00\u4e00\u4e2a\u201c\u6700\u540e\u4e00\u4e2a\u201d\u7684\u6570\u636e\u5143\u7d20\uff08\u5c3e\u8282\u70b9\uff09\u3002<\/p>\n

\u9664\u4e86\u7b2c\u4e00\u4e2a\u5143\u7d20\u5916\uff0c\u7ed3\u6784\u4e2d\u6bcf\u4e2a\u6570\u636e\u5143\u7d20\u5747\u53ea\u6709\u4e00\u4e2a\u524d\u9a71\u3002<\/p>\n

\u9664\u4e86\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u5916\uff0c\u7ed3\u6784\u4e2d\u6bcf\u4e2a\u6570\u636e\u5143\u7d20\u5747\u53ea\u6709\u4e00\u4e2a\u540e\u7ee7\u3002<\/p>\n

\u987a\u5e8f\u8868<\/h3>\n

\u987a\u5e8f\u8868\u662f\u7ebf\u6027\u8868\u5f53\u4e2d\u7684\u4e00\u79cd\uff0c\u7528\u4e00\u7ec4\u8fde\u7eed\u7684\u5185\u5b58\u5355\u5143\u4f9d\u6b21\u5b58\u50a8\u7ebf\u6027\u8868\u7684\u5404\u4e2a\u5143\u7d20\uff0c\u4e5f\u5c31\u662f\u8bf4\uff0c\u903b\u8f91\u4e0a\u76f8\u90bb\u7684\u5143\u7d20\uff0c\u5b9e\u9645\u7684\u7269\u7406\u5b58\u50a8\u7a7a\u95f4\u4e5f\u662f\u8fde\u7eed\u7684\u3002\u6211\u4eec\u53ef\u4ee5\u77e5\u9053\uff0c\u6570\u7ec4\u5728\u903b\u8f91\u4e0a\u662f\u7b26\u5408\u987a\u5e8f\u8868\u7684\u5b9a\u4e49\u7684\u3002<\/p>\n

\u521d\u59cb\u5316\u987a\u5e8f\u8868\uff1a<\/p>\n

#define AAA=100\r\ntypedef int INTAAA;\r\n\r\ntypedef struct \r\n{\r\n  INTAAA data[AAA];\r\n  int length;\r\n}SeqList;\r\n\r\nvoid initList(SeqList* L)\r\n{\r\n  L->length = 0\uff1b \r\n}\r\n<\/code><\/pre>\n
\u521d\u59cb\u5316\u987a\u5e8f\u8868(\u52a8\u6001\u5206\u914d\u5185\u5b58)\uff1a<\/p>\n
 <\/p>\n
#define AAA=100 \r\ntypedef int INTAAA;\r\n\r\ntypedef struct\r\n{\r\n  INTAAA* data;\r\n  int length;\r\n}SeqList;\r\n\r\nSeqList* initList()\r\n{\r\n  SeqList* L = (SeqList*)malloc(sizeof(SeqList));\r\n  L->data = (INTAAA*)malloc(sizeof(INTAAA) * AAA);\r\n  L->length = 0;\r\n  return L;\r\n}<\/code><\/pre>\n
\u5728\u5c3e\u90e8\u6dfb\u52a0\u5143\u7d20:<\/p>\n
 <\/p>\n
int appendElem(SeqList* L,INTAAA e)\r\n{\r\n  if (L->length>=AAA)\r\n  {\r\n    printf(\"\u987a\u5e8f\u8868\u5df2\u6ee1\\n\");\r\n    return 0;\r\n  }\r\n  L->data[L->length] = e;\r\n  L->length++;\r\n  return 1;\r\n}<\/code><\/pre>\n
\u987a\u5e8f\u8868\u904d\u5386:<\/p>\n
 <\/p>\n
void listElem(SeqList* L)\r\n{\r\n  for(int i = 0; i< L->length;i++)\r\n  {\r\n    printf(\"%d \",L->data[i]);\r\n  }\r\n  printf(\"\\n\");\r\n}<\/code><\/pre>\n
\u987a\u5e8f\u8868\u63d2\u5165\u5143\u7d20\uff1a<\/p>\n
 <\/p>\n
int insertElem(SeqList* L,int pos,INTAAA e)\r\n{\r\n  if(pos <= L->length)\r\n  {\r\n    for(int i = L->length-1; i>=pos-1 ; i--)\r\n    {\r\n      L->data[i+1] = L->data[i];\r\n    }\r\n    L->data[pos-1] = e;\r\n    L->length++;\r\n  }\r\n  return 1;\r\n}<\/code><\/pre>\n
\u987a\u5e8f\u8868\u5220\u9664\u5143\u7d20\uff08\u6ce8\uff1ae\u662f\u7528\u6765\u4fdd\u5b58\u88ab\u5220\u9664\u7684\u5143\u7d20\uff0c\u7528\u4e8e\u8fd4\u56de\u7ed9\u8c03\u7528\u8005\uff0c\u4e0d\u9700\u8981\u8fd4\u56de\u53ef\u5220\u9664\uff09\uff1a<\/p>\n
 <\/p>\n
int deleteElem(SeqList* L,int pos,INTAAA* e)\r\n{\r\n  *e = L->data[pos-1];\r\n  if(pos < L->length)\r\n  {\r\n    for(int i =pos ; i<L->length;i++)\r\n    {\r\n      L->data[i-1] = L->data[i];\r\n    }\r\n  }\r\n  L->length--;\r\n  return 1;\r\n}<\/code><\/pre>\n
\u987a\u5e8f\u8868\u67e5\u627e\uff1a<\/p>\n
 <\/p>\n
int findElem(SeqList* L,INTAAA e)\r\n{\r\n  for(int i = 0; i<L->length;i++)\r\n  {\r\n    if(L->data[i] == e)\r\n      {\r\n        return i+1;\r\n      }\r\n  }\r\n  return 0;\r\n}<\/code><\/pre>\n
\u00a0\u94fe\u8868<\/h3>\n
 <\/p>\n
\u94fe\u8868\u7684\u5b58\u50a8\u5355\u5143\u4e0d\u50cf\u987a\u5e8f\u8868\u90a3\u6837\u662f\u9700\u8981\u8fde\u7eed\u7684\uff0c\u94fe\u8868\u7684\u5b58\u50a8\u5355\u5143\u53ef\u4ee5\u662f\u8fde\u7eed\u7684\uff0c\u4e5f\u53ef\u4ee5\u662f\u4e0d\u8fde\u7eed\u7684\u3002<\/p>\n
\u5355\u94fe\u8868<\/h4>\n
typedef int INTAAA;\r\n\r\ntypedef struct node\r\n{\r\n  INTAAA data;\r\n  struct node* next;\r\n}Node;\r\n<\/code><\/pre>\n
\u5355\u94fe\u8868\u521d\u59cb\u5316\uff08\u5934\u8282\u70b9\uff09\uff1a<\/p>\n
 <\/p>\n
Node* initList()\r\n{\r\n  Node* head = (Node*)malloc(sizeof(Node));\r\n  head->data = 0;\r\n  head->next = NULL;\r\n  return head;\r\n}\r\n\r\nint main()\r\n{\r\n  Node* list = initList();\r\n  return 1;\r\n}<\/code><\/pre>\n
\u5355\u94fe\u8868\u63d2\u5165\u6570\u636e(\u5934\u63d2\u6cd5)\uff1a<\/p>\n
 <\/p>\n
int insertHead(Node* L,INTAAA e)\r\n{\r\n  Node* p = (Node*)malloc(sizeof(Node));\r\n  p->data =e;\r\n  p->next = L->next;\r\n  L->next = p;\r\n}\r\n\r\nint main()\r\n{\r\n  Node* list = initList();\r\n  insertHead(list,10);\r\n  insertHead(list,20); \r\n}<\/code><\/pre>\n
\u5355\u94fe\u8868\u904d\u5386\uff1a<\/p>\n
 <\/p>\n
void listNode(Node* L)\r\n{\r\n  Node* p = L->next;\r\n  while(p!=NULL)\r\n  {\r\n    printf(\"%d\\n\",p->data);\r\n    p = p->next;\r\n  }\r\n  printf(\"\\n\");\r\n}\r\n<\/code><\/pre>\n
 <\/p>\n
\u5355\u94fe\u8868\u63d2\u5165\u6570\u636e(\u5c3e\u63d2\u6cd5)\uff1a<\/p>\n
 <\/p>\n
\"\"<\/p>\n
\u5934\u63d2\u6cd5\u8ddf\u8f93\u5165\u7684\u6570\u636e\u662f\u76f8\u53cd\u7684\uff0c\u6bd4\u5982\u54b1\u4eec\u4f9d\u6b21\u63d2\u516510\u300120\u300130\uff0c\u8f93\u51fa\u7684\u662f30\u300120\u300110\uff0c\u8fd9\u65f6\u6211\u4eec\u53ef\u4ee5\u901a\u8fc7\u5c3e\u63d2\u6cd5\u6765\u89c4\u907f\u8fd9\u4e2a\u60c5\u51b5\u3002<\/p>\n
\u5c3e\u63d2\u6cd5\u548c\u5934\u63d2\u6cd5\u4e0d\u540c\uff0c\u5934\u63d2\u6cd5\u53ef\u4ee5\u5f88\u8f7b\u677e\u7684\u627e\u5230\u5934\u8282\u70b9\uff0c\u4f46\u5c3e\u63d2\u6cd5\u65e0\u6cd5\u76f4\u63a5\u627e\u5230\u5c3e\u8282\u70b9\uff0c\u6240\u4ee5\u6211\u4eec\u9700\u8981\u5148\u627e\u5230\u5c3e\u8282\u70b9\u3002<\/p>\n
Node* Get_tail(Node* L)\r\n{\r\n  Node* p =L;\r\n  while(p->next !=NULL)\r\n  {\r\n    p=p->next;\r\n  }\r\nreturn p;\r\n}<\/code><\/pre>\n
 <\/p>\n
 <\/p>\n
Node* insertTail(Node* tail,INTAAA e)\r\n{\r\n  Node* p =(Node*)malloc(sizeof(Node));\r\n  p->data = e;\r\n  tail->next = o;\r\n  p->next = NULL;\r\n  return p;\r\n}<\/code><\/pre>\n
 <\/p>\n
\u5355\u94fe\u8868\u63d2\u5165(\u6307\u5b9a\u4f4d\u7f6e\u63d2\u5165)\uff1a<\/p>\n
\"\"<\/p>\n
\u6ce8\u610f\u987a\u5e8f\u4e0d\u8981\u53cd\uff0c\u5426\u5219\u6307\u5411\u5b58\u50a880\u6570\u636e\u7684\u8282\u70b9\u7684\u5730\u5740\u4f1a\u88ab\u8986\u76d6\uff01<\/p>\n
int insertNode(Node* L,int pos,INTAAA e)\r\n{\r\n  Node* p = L;\/\/L\u662f\u5934\u8282\u70b9\r\n  int i = 0;\r\n  while(i<pos-1)\/\/\u5faa\u73af\u81f3\u6211\u4eec\u8981\u63d2\u5165\u7684\u524d\u4e00\u4e2a\u8282\u70b9\r\n    {\r\n      p = p->next;\r\n      i++;\r\n      if(p == NULL)\r\n        {\r\n          return0;\r\n        }\r\n    }\r\n\r\n  Node* q = (Node*)malloc(sizeof(Node));\r\n  q->data = e;\r\n  q->next = p->next;\r\n  p->next =q;\r\n  return 1;\r\n}<\/code><\/pre>\n
 <\/p>\n
\u5355\u94fe\u8868\u5220\u9664\u8282\u70b9\uff1a<\/p>\n
\u8981\u5220\u9664\u4e00\u4e2a\u8282\u70b9\uff0c\u9996\u5148\u8981\u627e\u5230\u8981\u5220\u9664\u7684\u8fd9\u4e2a\u8282\u70b9\u7684\u4e0a\u4e00\u4e2a\u8282\u70b9\uff0c\u7528\u6307\u9488q\u6765\u8bb0\u5f55\u8981\u5220\u9664\u7684\u8282\u70b9\uff08\u56e0\u4e3a\u8981\u91ca\u653e\u8fd9\u4e2a\u5220\u9664\u7684\u8282\u70b9\uff0c\u6240\u4ee5\u9700\u8981\u8bb0\u5f55\u4e00\u4e0b\uff09<\/p>\n
 <\/p>\n
int deleteNode(Node* L,int pos)\r\n{\r\n  Node* p = L;\r\n  int i = 0;\r\n  while(i<pos-1)\r\n  {\r\n    p = p->next;\r\n    i++;\r\n    if(p == NULL){ return 0;}\r\n  }\r\n  if(p->next == NULL)\r\n  {\r\n    printf(\"\u8981\u5220\u9664\u7684\u4f4d\u7f6e\u9519\u8bef\uff01\\n\")\uff1b\r\n    return 0;\r\n  }\r\n\/\/q\u6307\u5411\u8981\u5220\u9664\u7684\u8282\u70b9\uff0c\u4e00\u4f1a\u91ca\u653e\r\n  Node *q = p->next;\r\n\/\/\u8ba9\u8981\u5220\u9664\u8282\u70b9\u7684\u524d\u9a71\u6307\u5411\u8981\u5220\u9664\u8282\u70b9\u7684\u540e\u7ee7\r\n  p->next =q->next;\r\n  free(q);\r\n  return 1;\r\n}<\/code><\/pre>\n
 <\/p>\n
\u5355\u94fe\u8868\u83b7\u53d6\u94fe\u8868\u957f\u5ea6\uff1a<\/p>\n
int listLength(Node* L)\r\n{\r\n  Node* p =L;\r\n  int len = 0;\r\n  while(p->next != NULL)\r\n  {\r\n    p=p->next;\r\n    len++;\r\n  }\r\n  return len;\r\n}<\/code><\/pre>\n
 <\/p>\n
\u5355\u94fe\u8868\u91ca\u653e\u94fe\u8868\uff1a<\/p>\n
void freeList(Node* L)\r\n{\r\n  Node* p = L->next;\r\n  Node* q;\r\n\r\n  while(p!= NULL)\r\n  {\r\n    q= p->next;\r\n    free(p);\r\n    p = q;\r\n  }\r\n  L->next = NULL;\r\n}<\/code><\/pre>\n
\u7ec3\u4e60<\/h2>\n
1.\u5df2\u77e5\u4e00\u4e2a\u5e26\u6709\u8868\u5934\u8282\u70b9\u7684\u5355\u94fe\u8868\uff0c\u8282\u70b9\u7ed3\u6784\u4e3a
\n\"\"
\n\u5047\u8bbe\u8be5\u94fe\u8868\u53ea\u7ed9\u51fa\u4e86\u5934\u6307\u9488 list \u3002\u5728\u4e0d\u6539\u53d8\u94fe\u8868\u7684\u524d\u63d0\u4e0b\uff0c\u8bf7\u8bbe\u8ba1\u4e00\u4e2a\u5c3d\u53ef\u80fd\u9ad8\u6548\u7684\u7b97\u6cd5\uff0c\u67e5\u627e\u94fe\u8868\u4e2d\u5012\u6570\u7b2ck\u4e2a\u4f4d\u7f6e\u4e0a\u7684\u7ed3\u70b9(k\u4e3a\u6b63\u6574\u6570)\u3002\u82e5\u67e5\u627e\u6210\u529f\uff0c\u7b97\u6cd5\u8f93\u51fa\u8be5\u8282\u70b9\u7684 data \u57df\u7684\u503c\uff0c\u5e76\u8fd4\u56de1;\u5426\u5219\uff0c\u53ea\u8fd4\u56de 0 \u3002<\/p>\n
\u8981\u6c42:<\/p>\n
1)\u63cf\u8ff0\u7b97\u6cd5\u7684\u57fa\u672c\u601d\u60f3;<\/p>\n
2)\u63cf\u8ff0\u7b97\u6cd5\u7684\u8be6\u7ec6\u5b9e\u73b0\u6b65\u9aa4;<\/p>\n
3)\u6839\u636e\u8bbe\u8ba1\u601d\u60f3\u548c\u5b9e\u73b0\u6b65\u9aa4\uff0c\u91c7\u7528\u7a0b\u5e8f\u8bbe\u8ba1\u8bed\u8a00\u63cf\u8ff0\u7b97\u6cd5(\u4f7f\u7528C\u3001C++\u3001\u6216 Java\u8bed\u8a00\u5b9e\u73b0)\uff0c\u5173\u952e\u4e4b\u5904\u8bf7\u7ed9\u51fa\u7b80\u8981\u6ce8\u91ca\u3002<\/p>\n
\u7ecf\u5178\u601d\u8def\uff08\u53cc\u6307\u9488\uff09<\/strong>\uff1a<\/p>\n
\u901a\u8fc7\u5feb\u6162\u6307\u9488\u6765\u8fdb\u884c\uff0c\u5373\u6784\u5efa\u4e24\u4e2a\u6307\u9488\uff0c\u7b2c\u4e00\u4e2a\u6307\u9488\u6211\u4eec\u628a\u5b83\u53eb\u505a\u5feb\u6307\u9488\uff0c\u7b2c\u4e8c\u6307\u9488\u6211\u4eec\u628a\u5b83\u53eb\u505a\u6162\u6307\u9488\uff0c\u5047\u8bbek\u662f3\uff0c\u6211\u4eec\u5c31\u8ba9\u5feb\u8282\u70b9\u5148\u8d703\u6b65\uff1a<\/p>\n
\"\"<\/p>\n
\u7136\u540e\u5feb\u8282\u70b9\u548c\u6162\u8282\u70b9\u518d\u4e00\u8d77\u8d70\uff0c\u5f53\u5feb\u6307\u9488\u7684\u4e0b\u4e2a\u6307\u9488\u4e3aNULL\u65f6\uff0c\u6b64\u65f6\u6162\u6307\u9488\u6070\u597d\u4e3a\u5012\u6570\u7b2cK\u4e2a\u6307\u9488\uff1a<\/p>\n
\"\"<\/p>\n
typedef struct Node {\r\n    int data;\r\n    struct Node* link;\r\n} Node;\r\n\r\nint findNodeFS(Node* L, int k) {\r\n    \/\/ \u68c0\u67e5\u94fe\u8868\u662f\u5426\u4e3a\u7a7a\uff0c\u6216\u8005\u94fe\u8868\u65e0\u6570\u636e\u7ed3\u70b9\uff08\u5934\u7ed3\u70b9\u540e\u4e3a\u7a7a\uff09\r\n    if (L == NULL || L->link == NULL) {\r\n        printf(\"\u94fe\u8868\u4e3a\u7a7a\u6216\u65e0\u6570\u636e\u7ed3\u70b9\uff01\\n\");\r\n        return 0;\r\n    }\r\n\r\n    \/\/ \u521d\u59cb\u5316\u5feb\u6162\u6307\u9488\uff0c\u5747\u4ece\u7b2c\u4e00\u4e2a\u6709\u6548\u6570\u636e\u7ed3\u70b9\u5f00\u59cb\r\n    Node* fast = L->link;\r\n    Node* slow = L->link;\r\n\r\n    \/\/ \u5feb\u6307\u9488\u5148\u79fb\u52a8 k \u6b65\r\n    for (int i = 0; i < k; i++) {\r\n        if (fast == NULL) {  \/\/ \u82e5\u94fe\u8868\u6570\u636e\u8282\u70b9\u6570\u5c0f\u4e8e k\uff0c\u76f4\u63a5\u8fd4\u56de\u5931\u8d25\r\n            printf(\"\u94fe\u8868\u4e2d\u7684\u6570\u636e\u8282\u70b9\u4e0d\u8db3 %d \u4e2a\uff01\\n\", k);\r\n            return 0;\r\n        }\r\n        fast = fast->link;\r\n    }\r\n\r\n    \/\/ \u540c\u65f6\u79fb\u52a8\u5feb\u6162\u6307\u9488\uff0c\u76f4\u5230\u5feb\u6307\u9488\u5230\u8fbe\u94fe\u8868\u672b\u5c3e\r\n    while (fast != NULL) {\r\n        fast = fast->link;\r\n        slow = slow->link;\r\n    }\r\n\r\n    \/\/ \u6b64\u65f6 slow \u6307\u5411\u5012\u6570\u7b2c k \u4e2a\u8282\u70b9\r\n    printf(\"\u5012\u6570\u7b2c %d \u4e2a\u8282\u70b9\u7684\u503c\u4e3a %d\\n\", k, slow->data);\r\n    return 1;\r\n}<\/code><\/pre>\n
 <\/p>\n
\u4e2a\u4eba\u601d\u8def\uff1a<\/strong><\/p>\n
\u9996\u5148\uff0c\u6211\u4eec\u77e5\u9053\u4e86\u5934\u94fe\u8868\u662flist\uff0c\u90a3\u4e48list->link\u5b58\u653e\u7684\u5c31\u662f\u7b2c\u4e00\u4e2a\u8282\u70b9\u7684\u5730\u5740\uff0c\u800c\u9898\u76ee\u8981\u7684\u662f\u5012\u6570\u7b2ck\u4e2a\u4f4d\u7f6e\u4e0a\u7684\u8282\u70b9\uff0c\u6240\u4ee5\u6211\u4eec\u8981\u4ece\u5c3e\u8282\u70b9\u8fdb\u884c\uff0c\u4f46\u6211\u4eec\u6ca1\u6709\u5c3e\u8282\u70b9\u7684\u5730\u5740\uff0c\u6240\u4ee5\u8981\u5148\u67e5\u627e\u5c3e\u8282\u70b9\uff0c\u5373\u83b7\u53d6\u94fe\u8868\u957f\u5ea6\uff1a<\/p>\n
typedef struct node\r\n{\r\n  int data;\r\n  struct node* link;\r\n}node;\r\n\r\nnode* list = \/* \u5df2\u7ecf\u6784\u9020\u597d\u7684\u94fe\u8868\u5934\u6307\u9488 *\/;\r\nint k = \/* \u5012\u6570\u7b2cK\u7684\u503c *\/;\r\n\r\nint main()\r\n{\r\n  node* p = list->link; \/\/\u5b58\u50a8\u7b2c\u4e00\u4e2a\u8282\u70b9\r\n  int len = 0; \/\/len\u4e3a\u8282\u70b9\u7684\u957f\u5ea6\u3002\r\n\/\/\u8ba1\u7b97\u51fa\u8282\u70b9\u7684\u603b\u957f\u5ea6\u3002\r\n  while( p != NULL)\r\n    {\r\n      p = p->link;\r\n      len++;\r\n    }\r\n\/\/\u5224\u65ad\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9\u662f\u5426\u5728\u94fe\u8868\u4e0a\r\n  if(k>len || k<= 0)\r\n    {\r\n      return 0;\r\n    }\r\n\r\n  \/\/\u5c06\u6307\u9488\u79fb\u52a8\u81f3\u5012\u6570K\u8282\u70b9\u7684\u4f4d\u7f6e\r\n  p = list->link; \/\/p\u6307\u5411\u7b2c\u4e00\u4e2a\u8282\u70b9\r\n  int pos = 1;\r\n  while( pos < len- k+1)\r\n    {\r\n      p = p->link;\r\n      pos++;\r\n    }\r\n  \/\/\u5c06data\u503c\u8f93\u51fa\u81f3int kdata\u4e2d\r\n  int kdata = p->data;\r\n  return 1;\r\n}<\/code><\/pre>\n
 <\/p>\n
 <\/p>\n
2.\u5047\u5b9a\u91c7\u7528\u5e26\u5934\u8282\u70b9\u7684\u5355\u94fe\u8868\u4fdd\u5b58\u5355\u8bcd\uff0c\u5f53\u4e24\u4e2a\u5355\u8bcd\u6709\u76f8\u540c\u7684\u540e\u7f00\u65f6\uff0c\u5219\u53ef\u5171\u4eab\u76f8\u540c\u7684\u540e\u7f00\u5b58\u50a8\u7a7a\u95f4\uff0c\u4f8b\u5982\uff0c\u201cloading\u201d\u548c\u201cbeing\u201d\u7684\u5b58\u50a8\u6620\u50cf\u5982\u4e0b\u56fe\u6240\u793a\u3002<\/p>\n
\"\"
\n\u8bbe str1 \u548c str2 \u5206\u522b\u6307\u5411\u4e24\u4e2a\u5355\u8bcd\u6240\u5728\u5355\u94fe\u8868\u7684\u5934\u8282\u70b9\uff0c\u94fe\u8868\u7ed3\u70b9\u7ed3\u6784\u4e3a data|next\u8bf7\u8bbe\u8ba1\u4e00\u4e2a\u65f6\u95f4\u4e0a\u5c3d\u53ef\u80fd\u9ad8\u6548\u7684\u7b97\u6cd5\uff0c\u627e\u51fa\u7531str1\u548c str2 \u6240\u6307\u5411\u4e24\u4e2a\u94fe\u8868\u5171\u540c\u540e\u7f00\u7684\u8d77\u59cb\u4f4d\u7f6e(\u5982\u56fe\u5b57\u7b26i\u6240\u5728\u7ed3\u70b9\u7684\u4f4d\u7f6ep)\u3002\u8981\u6c42:
\n1)\u63cf\u8ff0\u7b97\u6cd5\u7684\u57fa\u672c\u8bbe\u8ba1\u601d\u60f3;<\/p>\n
2)\u6839\u636e\u8bbe\u8ba1\u601d\u60f3\uff0c\u91c7\u7528 C \u6216 C++ \u6216 Java \u8bed\u8a00\u63cf\u8ff0\uff0c\u5173\u952e\u4e4b\u5904\u7ed9\u51fa\u6ce8\u91ca\u3002<\/p>\n
3)\u8bf4\u660e\u4f60\u6240\u8bbe\u8ba1\u7b97\u6cd5\u7684\u65f6\u95f4\u590d\u6742\u3002<\/p>\n
\u8fd9\u9053\u9898\u76ee\u662f\u8bf4\uff0c\u4e0d\u540c\u7528\u94fe\u8868\u6765\u5b58\u50a8\u4e0d\u540c\u5355\u8bcd\uff0c\u4f46\u4e0d\u540c\u5355\u8bcd\u7684\u540e\u7f00\u82e5\u76f8\u540c\uff0c\u5219\u540e\u7f00\u4f7f\u7528\u540c\u4e00\u90e8\u5206\u7684\u94fe\u8868\uff0c\u7136\u540e\u94fe\u8868\u7684\u7ed3\u6784\u6709data\u548cnext\uff0c\u5178\u578b\u7684\u5355\u94fe\u8868\u7ed3\u6784\uff0c\u8fd9\u91cc\u7684data\u7684\u6570\u636e\u7c7b\u578b\u660e\u663e\u5e94\u8be5\u662fchar\u7c7b\u578b\u7684\uff0c\u7528\u6765\u5b58\u50a8\u82f1\u6587\u5b57\u7b26\uff0c\u9898\u76ee\u53c8\u8bf4\u8ba9\u5176\u5728\u65f6\u95f4\u4e0a\u5c3d\u53ef\u80fd\u9ad8\u6548\uff0c\u610f\u5473\u7740\u4e0d\u8ba9\u4f7f\u7528\u5d4c\u5957\u5faa\u73af\uff0c\u4f7f\u7528\u5d4c\u5957\u5faa\u73af\u4f1a\u5bfc\u81f4\u65f6\u95f4\u590d\u6742\u5ea6\u5347\u4e3aO(n\u00b2)\uff0c\u90a3\u4e48\u6211\u4eec\u53ef\u4ee5\u7ee7\u7eed\u7528\u53cc\u6307\u9488\uff08\u5feb\u6162\u6307\u9488\uff09\u7684\u601d\u8def\u6765\u89e3\u51b3\u8fd9\u9053\u9898\u76ee\uff1a<\/p>\n
\"\"<\/p>\n
\u7b2c\u4e00\u6b65\uff1a\u5206\u522b\u6c42\u51fa\u4e24\u4e2a\u94fe\u8868\u7684\u957f\u5ea6m\u548cn\u3002<\/p>\n
\u7b2c\u4e8c\u6b65\uff1a\u8ba9\u5feb\u6307\u9488\u6307\u5411\u8f83\u957f\u7684\u94fe\u8868\uff0c\u5148\u8d70m-n\u6216\u8005n-m\u6b65\u3002<\/p>\n
\u7b2c\u4e09\u6b65\uff1a\u540c\u6b65\u79fb\u52a8\u6307\u9488\uff0c\u5224\u65ad\u4ed6\u4eec\u662f\u5426\u6307\u5411\u540c\u4e00\u4e2a\u8282\u70b9\u3002<\/p>\n
typedef struct node\r\n{\r\n    char data;\r\n    struct node* next;\r\n}Node;\r\n\r\n\/\/\u6839\u636e\u9898\u76ee\u6240\u77e5\uff0cstr1\u548cstr2\u662f\u5934\u8282\u70b9\u3002\r\nvoid Findsfx(Node* str1,Node* str2)\r\n{\r\n    int strleng1 = 0;\r\n    int strleng2 = 0;\r\n    int lengsub = 0;\r\n    int hub = 0;\r\n    Node* p = str1;\r\n    Node* q = str2;\r\n    \/\/\u5148\u8ba1\u7b97\u4e24\u4e2a\u94fe\u8868\u7684\u957f\u5ea6\r\n\r\n    while(p->next != NULL)\r\n    {\r\n        p = p->next;\r\n        strleng1++;\r\n    }\r\n    while(q->next != NULL)\r\n    {\r\n        q = q->next;\r\n        strleng2++;\r\n    }\r\n\r\n    \/\/\u5224\u65ad\u54ea\u4e2a\u94fe\u8868\u7684\u957f\u5ea6\u66f4\u957f,\u5e76\u627e\u51fa\u540e\u7f00\u9996\u7ed3\u70b9\r\n    if(strleng1>=strleng2)\r\n    {\r\n        lengsub = strleng1 - strleng2;\r\n        hub = 0;\r\n        p = str1->next; \/\/str1\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u7ed3\u70b9\r\n        q = str2->next; \/\/str2\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u7ed3\u70b9\r\n        while(hub < lengsub)\r\n        {\r\n            p = p->next;\r\n            hub++;\r\n        }\r\n        \/\/\u6b64\u65f6p\u5df2\u7ecf\u53d8\u6210\u5feb\u6307\u9488\u5e94\u8be5\u5728\u7684\u4f4d\u7f6e\uff0c\u73b0\u5728\u8ba9\u5feb\u6162\u6307\u9488\u4e00\u8d77\u79fb\u52a8\r\n        while(p != q)\r\n        {\r\n            p = p->next;\r\n            q = q->next; \r\n        }\r\n        printf(\"\u540e\u7f00\u7684\u9996\u7ed3\u70b9\u662f%c\\n\",p->data);\r\n    }else\r\n    {\r\n        lengsub = strleng2 - strleng1;\r\n        hub = 0;\r\n        p = str1->next; \/\/str1\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u7ed3\u70b9\r\n        q = str2->next; \/\/str2\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u7ed3\u70b9\r\n        while(hub < lengsub)\r\n        {\r\n            q = q->next;\r\n            hub++;\r\n        }\r\n        \/\/\u6b64\u65f6q\u5df2\u7ecf\u53d8\u6210\u5feb\u6307\u9488\u5e94\u8be5\u5728\u7684\u4f4d\u7f6e\uff0c\u73b0\u5728\u8ba9\u5feb\u6162\u6307\u9488\u4e00\u8d77\u79fb\u52a8\r\n        while(p != q)\r\n        {\r\n            p = p->next;\r\n            q = q->next; \r\n        }\r\n        printf(\"\u540e\u7f00\u7684\u9996\u7ed3\u70b9\u662f%c\\n\",q->data);\r\n    }\r\n\r\n\r\n}<\/code><\/pre>\n
 <\/p>\n
3.\u7528\u5355\u94fe\u8868\u4fdd\u5b58n\u4e2a\u6574\u6570\uff0c\u7ed3\u70b9\u7684\u7ed3\u6784\u4e3a[data][link]\uff0c\u4e14|data|<=n(n \u4e3a\u6b63\u6574\u6570)\u3002\u73b0\u8981\u6c42\u8bbe\u8ba1\u4e00\u4e2a\u65f6\u95f4\u590d\u6742\u5ea6\u5c3d\u53ef\u80fd\u9ad8\u6548\u7684\u7b97\u6cd5\uff0c\u5bf9\u4e8e\u94fe\u8868\u4e2d data \u7684\u7edd\u5bf9\u503c\u76f8\u7b49\u7684\u8282\u70b9\uff0c\u4ec5\u4fdd\u7559\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u8282\u70b9\u800c\u5220\u9664\u5176\u4f59\u7edd\u5bf9\u503c\u76f8\u7b49\u7684\u7ed3\u70b9\u3002<\/p>\n
\u4f8b\u5982\uff0c\u82e5\u7ed9\u5b9a\u5355\u94fe\u8868[head]->[21]->[-15]->[-15]->[7]->[15]<\/p>\n
\u5219\u5220\u9664\u540e\u7684\u8282\u70b9\u4e3a [head]->[21]->[-15]->[7]<\/p>\n
\u8981\u6c42:
\n1)\u7ed9\u51fa\u7b97\u6cd5\u7684\u57fa\u672c\u8bbe\u8ba1\u601d\u60f3\u3002
\n2)\u4f7f\u7528 C \u6216 C++\u8bed\u8a00\uff0c\u7ed9\u51fa\u5355\u94fe\u8868\u8282\u70b9\u7684\u6570\u636e\u7c7b\u578b\u5b9a\u4e49\u3002
\n3)\u6839\u636e\u8bbe\u8ba1\u601d\u60f3\uff0c\u91c7\u7528 C \u6216 C++ \u8bed\u8a00\u63cf\u8ff0\u7b97\u6cd5\uff0c\u5173\u952e\u4e4b\u5904\u7ed9\u51fa\u6ce8\u91ca\u3002
\n4)\u8bf4\u660e\u4f60\u6240\u8bbe\u8ba1\u7b97\u6cd5\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u548c\u7a7a\u95f4\u590d\u6742\u5ea6\u3002<\/p>\n
\u8fd9\u91cc\u6211\u4eec\u4f7f\u7528\u4e00\u4e2a\u65b0\u7684\u601d\u60f3\uff0c\u90a3\u5c31\u662f\u62ff\u7a7a\u95f4\u6362\u65f6\u95f4\uff0c\u4f60\u53ea\u9700\u8981\u904d\u5386\u5faa\u73af\u4e00\u6b21\u8fd9\u4e2a\u94fe\u8868\u5c31\u53ef\u4ee5\u4e86\uff0c\u5c31\u80fd\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\u3002<\/p>\n
|data|<=n \u5728\u8fd9\u91cc\u662f\u4ec0\u4e48\u610f\u601d\uff1f\u6839\u636e\u9898\u76ee\u53ef\u77e5\uff0cn\u7684\u672c\u610f\u662f\u5355\u94fe\u8868\u4fdd\u5b58n\u7684\u4e2a\u6570\uff0c|data|<=n\u662f\u5e72\u4ec0\u4e48\u7684\uff1f\u610f\u5473\u7740\u5982\u679cn\u6700\u5c11\u7b49\u4e8e|data|\u7684\u6700\u5927\u503c\uff0c\u6240\u4ee5\u6211\u4eec\u53ef\u4ee5\u4f7f\u7528\u4e00\u4e2an+1\u7684\u6570\u7ec4\uff0c\u6765\u6807\u8bb0\u6240\u6709data\u7684\u51fa\u73b0\u6b21\u6570\uff0c\u82e5\u5927\u4e8e0\uff0c\u5219\u4ee3\u8868\u51fa\u73b0\u8fc7\uff0c\u7136\u540e\u518d\u5728\u94fe\u8868\u4e2d\u6267\u884c\u5220\u9664\u64cd\u4f5c\uff1a<\/p>\n
void removeNode(Node* L, int n)\r\n{\r\n    Node* p = L;\r\n    int index; \/\/ \u7528\u4f5c\u6570\u7ec4\u4e0b\u6807\r\n    int* q = (int*)malloc(sizeof(int) * (n + 1));\r\n\r\n    \/\/ \u904d\u5386\u6570\u7ec4\uff0c\u5c06\u6240\u6709\u5143\u7d20\u521d\u59cb\u5316\u4e3a0\r\n    for (int i = 0; i < n + 1; i++)\r\n    {\r\n        *(q + i) = 0;\r\n    }\r\n    \r\n    \/\/ \u904d\u5386\u6574\u4e2a\u94fe\u8868\uff08\u6ce8\u610f p \u6307\u5411\u5934\u8282\u70b9\uff0c\u4fdd\u7559\u5934\u8282\u70b9\uff0c\u4e0d\u5904\u7406 head->data\uff09\r\n    while (p->next != NULL)\r\n    {\r\n        \/\/ \u53d6\u5f53\u524d\u5f85\u68c0\u67e5\u8282\u70b9\u7684\u7edd\u5bf9\u503c\uff0c\u4f5c\u4e3a\u6570\u7ec4\u4e0b\u6807\r\n        index = abs(p->next->data);\r\n        if (*(q + index) == 0)\r\n        {\r\n            \/\/ \u7b2c\u4e00\u6b21\u51fa\u73b0\uff0c\u505a\u6807\u8bb0\uff0c\u7136\u540e\u6307\u9488\u5411\u540e\u79fb\u52a8\r\n            *(q + index) = 1;\r\n            p = p->next;\r\n        }\r\n        else\r\n        {\r\n            \/\/ \u91cd\u590d\u8282\u70b9\uff1a\u5220\u9664 p->next \u8282\u70b9\r\n            Node* temp = p->next;\r\n            p->next = temp->next;\r\n            free(temp);\r\n        }\r\n    }\r\n    free(q);\r\n}<\/code><\/pre>\n
 <\/p>\n
4.\u53cd\u8f6c\u4e0b\u5217\u94fe\u8868<\/p>\n
\"\"<\/p>\n
\u53cd\u8f6c\u94fe\u8868\u7684\u5957\u8def\uff1a<\/p>\n
\u7b2c\u4e00\u6b65\uff1a\u5148\u62ff\u4e00\u4e2afirst\u6307\u5411\u4e00\u4e2a\u7a7a\u503c\uff0c\u518d\u62ff\u4e00\u4e2asecond\u6307\u5411\u7b2c\u4e00\u7ed3\u70b9\uff0c\u518d\u62ff\u4e00\u4e2athird\u6307\u5411second\u6307\u5411\u7684\u4e0b\u4e00\u4e2a\u7ed3\u70b9\u3002<\/p>\n
\"\"<\/p>\n
\u7b2c\u4e8c\u6b65\uff1a\u8ba9second\u6307\u5411\u7a7a\u503c\u3002<\/p>\n
\"\"<\/p>\n
\u7b2c\u4e09\u6b65\uff1a\u540c\u65f6\u79fb\u52a8first\u3001second\u3001third\u3002<\/p>\n
\"\"<\/p>\n
\u7b2c\u56db\u6b65\uff1a\u8ba9second\u6307\u5411\u524d\u4e00\u4e2a\u7ed3\u70b9\u3002<\/p>\n
\"\"<\/p>\n
\u7b2c\u4e94\u6b65\uff1a\u91cd\u590d\u4e09\u56db\u6b65\u9aa4\u76f4\u5230second\u8d70\u5411\u7a7a\u503c\u3002<\/p>\n
\"\"<\/p>\n
\u7b2c\u516d\u6b65\uff1a\u7ed9\u94fe\u8868\u5b89\u88c5\u5934\u8282\u70b9\u3002<\/p>\n
\"\"<\/p>\n
typedef struct node\r\n{\r\n    int data;\r\n    struct node* next;\r\n}Node;\r\n\r\nNode* initList()\r\n{\r\n    Node* head = (Node*)malloc(sizeof(Node));\r\n    head->data = 0;\r\n    head->next = NULL;\r\n    return head;\r\n}\r\n\r\nNode* reverseList(Node* head)\r\n{\r\n    Node* first = NULL;\r\n    Node* second = head->next;\r\n    Node* third ;\r\n\r\n    while(second != NULL)\r\n    {\r\n        third = second->next;\r\n        second->next = first;\r\n\r\n        first = second;\r\n        second = third;\r\n    }\r\n    Node* hd = initList();\r\n    hd->next = first;\r\n    return hd;\r\n}<\/code><\/pre>\n
5.\u5220\u9664\u94fe\u8868\u4e2d\u95f4\u8282\u70b9\uff08\u6ce8\uff1a\u5bf9\u4e8e\u5076\u6570\uff0c\u4f8b\u5982123456\uff0c\u90a3\u4e484\u7b97\u4f5c\u4e2d\u95f4\u8282\u70b9\uff09<\/p>\n
\"\"<\/p>\n
\u90a3\u4e48\u8fd9\u9053\u9898\uff0c\u6211\u4eec\u8fd8\u662f\u91c7\u7528\u5feb\u6162\u6307\u9488\u7684\u73a9\u6cd5\uff0c\u53ea\u4e0d\u8fc7\u8fd9\u4e2a\u5feb\u6307\u9488\u8981\u4e00\u6b21\u8d70\u4e24\u6b65\uff0c\u6162\u6307\u9488\u4e00\u6b21\u8d70\u4e00\u6b65\uff0c\u8fd9\u6837\u7684\u8bdd\uff0c\u5f53\u5feb\u6307\u9488\u7684\u4e0b\u4e00\u4e2a\u7ed3\u70b9\u662f\u7a7a\u7ed3\u70b9\u65f6\uff0c\u6162\u6307\u9488\u7684\u4e0b\u4e00\u4e2a\u7ed3\u70b9\u5c31\u662f\u6211\u4eec\u8981\u5220\u9664\u7684\u4e2d\u95f4\u7ed3\u70b9\u3002<\/p>\n
typedef struct node\r\n{\r\n    int data;\r\n    struct node* next;\r\n}Node;\r\n\r\nint delMiddleNode(Node* head)\r\n{\r\n    Node* fast = head->next;\r\n    Node* slow = head;\r\n\r\n    while(fast != NULL && fast->next != NULL)\r\n    {\r\n        fast = fast->next->next;\r\n        slow = slow->next;\r\n    }\r\n\r\n    Node* q = slow->next;\r\n    slow->next = q->next;\r\n    free(q);\r\n    return 1;\r\n}<\/code><\/pre>\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
\u7ebf\u6027\u8868 \u7531n\uff08n>=0\uff09\u4e2a\u6570\u636e\u7279\u6027\u76f8\u540c\u7684\u5143\u7d20\u6784\u6210\u7684\u6709\u9650\u5e8f\u5217\uff0c\u79f0\u4e3a\u7ebf\u6027\u8868\u3002\u5373\uff0c\u7ebf\u6027\u8868\u662fn\u4e2a\u6570\u636e\u5143\u7d20\u7684\u6709\u9650\u5e8f […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-1535","post","type-post","status-publish","format-standard","hentry","category-c"],"_links":{"self":[{"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/posts\/1535","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/comments?post=1535"}],"version-history":[{"count":11,"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/posts\/1535\/revisions"}],"predecessor-version":[{"id":1565,"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/posts\/1535\/revisions\/1565"}],"wp:attachment":[{"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/media?parent=1535"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/categories?post=1535"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aoofoo.com\/index.php\/wp-json\/wp\/v2\/tags?post=1535"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}