blocks|key|3316300|text|你希望这能做什么？|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3316301|if+(+start->info+==+ser+)+{|code-block|syntax|javascript|3316302|它正在检查start->info是否指向ser数组的开头。您可能希望使用strcmp来比较字符串。|offset|length|style|CODE|3316303|entityMap^0|0|0|5|B|K|3|10|6|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Q|8|@$I|R|J|S|K|L]|$I|T|J|U|K|L]|$I|V|J|W|K|L]]|9|@]|A|$]]|$1|M|3|-4|5|6|7|X|8|@]|9|@]|A|$]]]|N|$]]

What do you expect this to do?

<pre><code>if ( start-&gt;info == ser ) {
</code></pre>

It is checking if <code>start-&gt;info</code> points to the start of the <code>ser</code> array. You probably want to use <code>strcmp</code> to compare strings.

blocks|key|366113|text|要比较2个字符串，请使用strcmp()。使用"==“将比较2个指针，而不是字符串的内容。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|366114|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

To compare 2 strings, use strcmp(). Using "==" will compare 2 pointers, not the content of the strings.

blocks|key|2273934|text|在您的例子中，您应该比较字符串的内容，而不是它们的起始地址。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2273935|正确版本|offset|length|style|BOLD|2273936|void+search()+{

++char+ser[20];
++cout+<<+"enter+data+to+be+searched"+<<+endl;
++gets(ser);

++for+(start=head;+start->ptr!=NULL;+start=start->ptr)
++{
++++if+(strcmp(start->info,+ser)+==+0)
++++{
++++++cout+<<+"found"+<<+endl;
++++++return;
++++}
++}
++cout+<<+"not+found"+<<+endl;
}|code-block|syntax|javascript|2273937|更多地提到|2273938|在for循环之前，你需要先检查head。否则，如果head为NULL，程序将崩溃。|CODE|2273939|entityMap^0|0|0|4|0|0|0|5|0|1|3|F|4|P|4|0^^$0|@$1|2|3|4|5|6|7|T|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|U|8|@$D|V|E|W|F|G]]|9|@]|A|$]]|$1|H|3|I|5|J|7|X|8|@]|9|@]|A|$K|L]]|$1|M|3|N|5|6|7|Y|8|@$D|Z|E|10|F|G]]|9|@]|A|$]]|$1|O|3|P|5|6|7|11|8|@$D|12|E|13|F|Q]|$D|14|E|15|F|Q]|$D|16|E|17|F|Q]]|9|@]|A|$]]|$1|R|3|-4|5|6|7|18|8|@]|9|@]|A|$]]]|S|$]]

In your case, you should compare the contents of strings instead of the starting address of them.

Correct version:

<pre><code>void search() {

 char ser[20];
 cout &lt;&lt; "enter data to be searched" &lt;&lt; endl;
 gets(ser);

 for (start=head; start-&gt;ptr!=NULL; start=start-&gt;ptr)
 {
 if (strcmp(start-&gt;info, ser) == 0)
 {
 cout &lt;&lt; "found" &lt;&lt; endl;
 return;
 }
 }
 cout &lt;&lt; "not found" &lt;&lt; endl;
}
</code></pre>

A bit more to mention

You need check <code>head</code> first before the <code>for</code> loop. Otherwise, the program will crash if <code>head</code> is NULL.

blocks|key|5428564|text|你的循环状况很危险。您没有检查“start”本身是否为空。此外，您正在比较下一个元素是否可用，如果下一个元素不可用，则会丢失当前元素。字符串比较也不正确。按如下方式更新您的循环：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5428565|for+(+start=head;+start+!=+NULL;+start=start->ptr+)+{
++++++++if+(+strcmp(start->info,+ser)+==+0+)+{
++++++++++cout+<<+"ok"+<<+endl;
++++++++++break;
++++++++}
++++++}|code-block|syntax|javascript|5428566|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|$]]

Your loop condition is dangerous. You are not checking if the 'start' itself is NULL or Not. Furthermore, you are comparing if the Next element is available or not and thus losing the current element if next element is not available. String comparison is also incorrect. Update your loop as following: 

<pre><code>for ( start=head; start != NULL; start=start-&gt;ptr ) {
 if ( strcmp(start-&gt;info, ser) == 0 ) {
 cout &lt;&lt; "ok" &lt;&lt; endl;
 break;
 }
 }
</code></pre>

blocks|key|2277775|text|赛马|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2277776|首先，欢迎来到论坛，也欢迎精彩、令人沮丧和成果丰硕的计算机编程世界。|2277777|其次，我编辑了你的帖子。如果您现在单击edit按钮，您将看到如何布局您的源代码，以便论坛很好地显示它。|offset|length|style|CODE|2277778|第三，我猜你指的是return，你说的是break+...这样您就不会总是看到“找不到”的消息。这是你想要的吗？|2277779|第四，我建议您将用户输入部分与列表搜索部分分开...这很容易做到，而且它使链表搜索可用于任何字符串(来自任何地方)，而不仅仅是用户现在输入的字符串。同样，将输出从搜索中分离出来，这样您就可以在以后重用搜索，以便在这种情况下生成任何合适的输出。|2277780|最后，这些变量名(请原谅)太烂了！|2277781|所以..。我的ANSI-C版本看起来像这样：|2277782|int+contains(char*+target)+{
++for+(+Node+node=head;+node->next!=NULL;+node=node->next+)+{
++++if+(+strcmp(node->data,+target)==0+)+{
++++++return+0;+//+TRUE
++++}
++}
++return+1;+//+FALSE
}|code-block|syntax|javascript|2277783|以上是链表各部分的“相当标准”的名称，它们有助于使您的代码更具可读性，因此可维护性更好。另外，WTF是一个“ser...”“目标”怎么样？|2277784|如果这都是你想不到的，那就别担心了。暂时忽略这个建议。|2277785|干杯。基思。|2277786|entityMap^0|0|0|J|4|0|9|6|K|5|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|15|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|16|8|@$F|17|G|18|H|I]]|9|@]|A|$]]|$1|J|3|K|5|6|7|19|8|@$F|1A|G|1B|H|I]|$F|1C|G|1D|H|I]]|9|@]|A|$]]|$1|L|3|M|5|6|7|1E|8|@]|9|@]|A|$]]|$1|N|3|O|5|6|7|1F|8|@]|9|@]|A|$]]|$1|P|3|Q|5|6|7|1G|8|@]|9|@]|A|$]]|$1|R|3|S|5|T|7|1H|8|@]|9|@]|A|$U|V]]|$1|W|3|X|5|6|7|1I|8|@]|9|@]|A|$]]|$1|Y|3|Z|5|6|7|1J|8|@]|9|@]|A|$]]|$1|10|3|11|5|6|7|1K|8|@]|9|@]|A|$]]|$1|12|3|-4|5|6|7|1L|8|@]|9|@]|A|$]]]|13|$]]

Saima,

Firstly, Welcome to the forums, and welcome also the wonderful, frustrating, and fruitful world of computer programming.

Secondly, I edited your post. If you click the <code>edit</code> button now you'll see how to layout your source-code, so the forum displays it nicely.

Thirdly, I guess you meant <code>return</code> where you said <code>break</code> ... so that you don't allways see the "not found" message. Is that what you wanted?

Fourthly, I suggest you seperate the user-input part from the list-search part... it's easily done, and it makes the linked-list-search usable with any string (from anywhere), not just one which user enters right now. Likewise seperate the output from the search, that way you can re-use the search later, to produce whatever output is appropriate in the circumstances.

Lastly, Those variable names (forgive me) suck! 

So... My ANSI-C version would look something like this:

<pre><code>int contains(char* target) {
 for ( Node node=head; node-&gt;next!=NULL; node=node-&gt;next ) {
 if ( strcmp(node-&gt;data, target)==0 ) {
 return 0; // TRUE
 }
 }
 return 1; // FALSE
}
</code></pre>

The above are "fairly standard" names for the parts of a linked list, which help to make your code that much more readable, and therefore maintainable. Also WTF is a "ser"... how-about "target"? 

If this is all over your head then don't worry about it... just ignore this advise, for now.

Cheers. Keith.

blocks|key|366165|text|Get是危险的，因为它不提供指定缓冲区长度的方法。可以选择使用char数组，但在这里使用std::string会更容易一些。我已经将find功能提取到一个单独的函数中。这允许您使用相同的函数来搜索列表，而不管您如何获取要搜索的值，或者您希望如何处理它。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|366166|Node*+find(Node*+head,+const+string&+needle)+{
++++for+(;+head;+head+=+head->ptr)+{
++++++++if+(head->info+==+needle)+{
++++++++++++return+head;
++++++++}
++++}
++++return+0;
}

void+search(Node*+head)+{
++++string+needle;
++++cout+<<+"Data+to+be+searched:+";
++++if+(!getline(cin,+needle))+{
++++++++//+Do+something+appropriate,+such+as+throw+an+exception,+return
++++++++//+an+error+code+(if+you+change+the+function's+interface),+or
++++++++//+simply+exit.
++++++++abort();
++++}

++++Node*+found+=+find(head,+needle);
++++if+(found)+{
++++++++cout+<<+"Found.\n";
++++}
++++else+{
++++++++cout+<<+"Not+found.\n";
++++}
}|code-block|syntax|javascript|366167|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|$]]

Gets is dangerous, as it provides no way to specify the length of your buffer. There are alternatives to use with char arrays, but here it would simply be easier to use a std::string. I've extracted the find functionality into a separate function. This allows you to use the same function to search the list regardless of how you get the value to search for, or what you want to do with it.

<pre><code>Node* find(Node* head, const string&amp; needle) {
 for (; head; head = head-&gt;ptr) {
 if (head-&gt;info == needle) {
 return head;
 }
 }
 return 0;
}

void search(Node* head) {
 string needle;
 cout &lt;&lt; "Data to be searched: ";
 if (!getline(cin, needle)) {
 // Do something appropriate, such as throw an exception, return
 // an error code (if you change the function's interface), or
 // simply exit.
 abort();
 }

 Node* found = find(head, needle);
 if (found) {
 cout &lt;&lt; "Found.\n";
 }
 else {
 cout &lt;&lt; "Not found.\n";
 }
}
</code></pre>

Here is my code for searching in a linked list, but it doesn't give me the correct result. Please help me, i'm very worried about it.

<pre><code>search() {

 char ser[20];
 cout &lt;&lt; "enter data to be searched" &lt;&lt; endl;
 gets(ser);

 for ( start=head; start-&gt;ptr!=NULL; start=start-&gt;ptr ) {
 if ( start-&gt;info == ser ) {
 cout &lt;&lt; "ok" &lt;&lt; endl;
 break;
 }
 }
 cout &lt;&lt; "not found" &lt;&lt; endl;
}
</code></pre>

Thanks,
Saima Kanwal Bhutta

searching in linked list

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

下面是我在链表中进行搜索的代码，但它没有给出正确的结果。请帮帮我，我很担心。search() { char ser[20]; cout << "enter data to be searched" << endl; gets(ser); for ( start=head; start->ptr!=NULL; s...

问在链表中搜索
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问在链表中搜索EN