blocks|key|4476397|text|您从不在循环中更新checkPt的值。更改线路|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|4476398|checkPt->next;|code-block|syntax|javascript|4476399|至|4476400|checkPt+=+checkPt->next;|4476401|来解决这个问题。|4476402|请注意，该函数可能还存在进一步的问题。尽管它的名字，它实际上并没有添加任何东西到列表中。相反，它编辑尾部项的内容。如果这不是故意的，您将需要malloc一个新元素，然后将其添加到尾部。|4476403|entityMap^0|9|7|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@$9|V|A|W|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|X|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|Y|8|@]|D|@]|E|$]]|$1|M|3|N|5|H|7|Z|8|@]|D|@]|E|$I|J]]|$1|O|3|P|5|6|7|10|8|@]|D|@]|E|$]]|$1|Q|3|R|5|6|7|11|8|@]|D|@]|E|$]]|$1|S|3|-4|5|6|7|12|8|@]|D|@]|E|$]]]|T|$]]

You never update the value of <code>checkPt</code> in your loop. Change the line

<pre><code>checkPt-&gt;next;
</code></pre>

to

<pre><code>checkPt = checkPt-&gt;next;
</code></pre>

to fix this.

Note that there may be further problems with the function. Despite its name, it doesn't actually add anything to the list. It edits the contents of the tail item instead. If this isn't deliberate, you'll need to malloc a new element then add it to the tail.

blocks|key|4476407|text|void+addCheckPoint(struct+checkPoints+**checkPoint)+{
++++struct+checkPoints+*checkPt+=+*checkPoint;

++++while+(checkPt+!=+NULL)+{
++++++++if+(checkPt->next+==+NULL)+{
++++++++++++scanf("%25c+%25d+%25d+%25d+%25d",+checkPt->dropOut,+checkPt->currentPoint,+checkPt->competitor,+checkPt->hour,+checkPt->minute);
++++++++}
++++++++checkPt+=+checkPt->next;
++++}
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|4476408|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>void addCheckPoint(struct checkPoints **checkPoint) {
 struct checkPoints *checkPt = *checkPoint;

 while (checkPt != NULL) {
 if (checkPt-&gt;next == NULL) {
 scanf("%c %d %d %d %d", checkPt-&gt;dropOut, checkPt-&gt;currentPoint, checkPt-&gt;competitor, checkPt-&gt;hour, checkPt-&gt;minute);
 }
 checkPt = checkPt-&gt;next;
 }
}
</code></pre>

blocks|key|3995450|text|尝尝这个|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3995451|+void+addCheckPoint(struct+checkPoints+**checkPoint)+{
++++++++struct+checkPoints+*checkPt+=+*checkPoint;

++++++++while+(checkPt->next+!=+NULL)+{
+++++++++++++checkPt=checkPt->next;
++++++++++++if+(checkPt+==+NULL)+{
++++++++++++++++scanf("%25c+%25d+%25d+%25d+%25d",+&checkPt->dropOut,+&checkPt->currentPoint,+&checkPt->competitor,+&checkPt->hour,+&checkPt->minute);
++++++++++++}

++++++++}
++++}|code-block|syntax|javascript|3995452|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

try this

<pre><code> void addCheckPoint(struct checkPoints **checkPoint) {
 struct checkPoints *checkPt = *checkPoint;

 while (checkPt-&gt;next != NULL) {
 checkPt=checkPt-&gt;next;
 if (checkPt == NULL) {
 scanf("%c %d %d %d %d", &amp;checkPt-&gt;dropOut, &amp;checkPt-&gt;currentPoint, &amp;checkPt-&gt;competitor, &amp;checkPt-&gt;hour, &amp;checkPt-&gt;minute);
 }

 }
 }
</code></pre>

blocks|key|646319|text|#include+<stdlib.h>
#include+<stdio.h>

struct+checkPoints
{
++++char+dropOut;
++++int+currentPoint;
++++int+competitor;
++++int+hour;
++++int+minute;

++struct+checkPoints+*next;
};

void+addCheckPoint(struct+checkPoints+**checkPoint)+{
++++while+(*checkPoint)
++++++++checkPoint+=+&(*checkPoint)->next;

++++/*+FIXME:+check+malloc()+return+value+*/
++++*checkPoint+=+malloc(sizeof+(struct+checkPoints));
++++(*checkPoint)->next+=+0;

++++/*+NOTE:+the+leading+space+in+front+of+the+%25c+*/
++++scanf("+%25c+%25d+%25d+%25d+%25d",
++++++++++&(*checkPoint)->dropOut,
++++++++++&(*checkPoint)->currentPoint,
++++++++++&(*checkPoint)->competitor,
++++++++++&(*checkPoint)->hour,
++++++++++&(*checkPoint)->minute);
}

struct+checkPoints+*list+=+0;

int
main+()
{
++++addCheckPoint+(&list);
++++addCheckPoint+(&list);
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|646320|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>#include &lt;stdlib.h&gt;
#include &lt;stdio.h&gt;

struct checkPoints
{
 char dropOut;
 int currentPoint;
 int competitor;
 int hour;
 int minute;

 struct checkPoints *next;
};

void addCheckPoint(struct checkPoints **checkPoint) {
 while (*checkPoint)
 checkPoint = &amp;(*checkPoint)-&gt;next;

 /* FIXME: check malloc() return value */
 *checkPoint = malloc(sizeof (struct checkPoints));
 (*checkPoint)-&gt;next = 0;

 /* NOTE: the leading space in front of the %c */
 scanf(" %c %d %d %d %d",
 &amp;(*checkPoint)-&gt;dropOut,
 &amp;(*checkPoint)-&gt;currentPoint,
 &amp;(*checkPoint)-&gt;competitor,
 &amp;(*checkPoint)-&gt;hour,
 &amp;(*checkPoint)-&gt;minute);
}

struct checkPoints *list = 0;

int
main ()
{
 addCheckPoint (&amp;list);
 addCheckPoint (&amp;list);
}
</code></pre>

I ran into a problem, I want to add item to the end of the linked list, but it seems that i am getting sucked in an infinite loop here.

<pre><code>void addCheckPoint(struct checkPoints **checkPoint) {
 struct checkPoints *checkPt = *checkPoint;

 while (checkPt-&gt;next != NULL) {
 checkPt-&gt;next;
 if (checkPt-&gt;next == NULL) {
 scanf("%c %d %d %d %d", &amp;checkPt-&gt;dropOut, &amp;checkPt-&gt;currentPoint, &amp;checkPt-&gt;competitor, &amp;checkPt-&gt;hour, &amp;checkPt-&gt;minute);
 }
 }
}
</code></pre>

Infinite while loop in linked list C

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我遇到了一个问题，我想将项添加到链表的末尾，但似乎我在这里陷入了无限循环。void addCheckPoint(struct checkPoints **checkPoint) {    struct checkPoints *checkPt = *checkPoint;    while (checkPt->next...

问链表C中的无限while循环
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问链表C中的无限while循环EN