Can't get in to ask questions.I want to ask you a question about the return value (traversal of the graph), please give Xiaobai an answer.

About the word Solitaire,Can you link all the words together（String it in a line,No need to form a circle）

2 6 aloha arachnid dog gopher rat tiger 3 oak maple elm

为什么返回值是0;而不是 n..The first one can be completely connected end to end.求解答啊

登录后复制

      
      

       
       #include <stdio.h>
       
       

       
       #include <string.h>
       
       

       
       #include <vector>
       
       

       
       using 
       
       namespace 
       
       std;
       
       

       
       vector
       
       <
       
       int
       
       >
       
       map[
       
       30];
       
       

       
       int 
       
       visit[
       
       30][
       
       30],
       
       flag,
       
       n;
       
       

       
       int 
       
       find(
       
       int 
       
       star,
       
       int 
       
       ant)
       
       
{  
       
       
  
       
       printf(
       
       "%d %d\n",
       
       ant,
       
       n);
       
       
  
       
       if(
       
       ant
       
       ==
       
       n)
       
       
  {
       
       
    
       
       printf(
       
       "weishenme %d\n",
       
       n);
       
       //My question is here whyant已经等于n了,But did not implement the followingreturn n; 返回值却是0 
       
       
    
       
       return 
       
       n;
       
       
  }
       
       
  
       
       for(
       
       int 
       
       i
       
       =
       
       0;
       
       i
       
       <
       
       map[
       
       star].
       
       size();
       
       i
       
       ++)
       
       
  {
       
       
    
       
       if(
       
       map[
       
       star][
       
       i]
       
       &&!
       
       visit[
       
       star][
       
       i])
       
       //visit[][]Mark words that have already been judged 
       
       
    {
       
       
      
       
       visit[
       
       star][
       
       i]
       
       =
       
       1;
       
       
      
       
       ant
       
       =
       
       ant
       
       +
       
       1;
       
       
      
       
       find(
       
       map[
       
       star][
       
       i],
       
       ant);  
       
       
    }
       
       
  }
       
       
  
       
       return 
       
       0;
       
       //It feels like the value here is returned 
       
       
}
       
       

       
       int 
       
       main()
       
       
{
       
       
  
       
       int 
       
       ncase;
       
       
  
       
       char 
       
       str[
       
       35];
       
       
  
       
       scanf(
       
       "%d",
       
       &
       
       ncase);
       
       //ncase组数组 
       
       
  
       
       while(
       
       ncase
       
       --)
       
       
  {
       
       
    
       
       scanf(
       
       "%d",
       
       &
       
       n);
       
       //n个单词 
       
       
    
       
       memset(
       
       map,
       
       0,
       
       sizeof(
       
       map));
       
       
    
       
       for(
       
       int 
       
       i
       
       =
       
       0;
       
       i
       
       <
       
       n;
       
       i
       
       ++)
       
       
    {
       
       
      
       
       scanf(
       
       "%s",
       
       str);
       
       
      
       
       int 
       
       len
       
       =
       
       strlen(
       
       str);
       
       
      
       
       map[
       
       str[
       
       0]
       
       -
       
       'a'
       
       +
       
       1].
       
       push_back(
       
       str[
       
       len
       
       -
       
       1]
       
       -
       
       'a'
       
       +
       
       1);
       
       
      
       
       memset(
       
       str,
       
       0,
       
       sizeof(
       
       str));
       
       
    }
       
       
    
       
       memset(
       
       visit,
       
       0,
       
       sizeof(
       
       visit));
       
       
    
       
       printf(
       
       "%d\n",
       
       find(
       
       1,
       
       0));
       
       //结果是0 
       
       
  }
       
       
  
       
       return 
       
       0;
       
       
}
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
       
       
7.
       
       
8.
       
       
9.
       
       
10.
       
       
11.
       
       
12.
       
       
13.
       
       
14.
       
       
15.
       
       
16.
       
       
17.
       
       
18.
       
       
19.
       
       
20.
       
       
21.
       
       
22.
       
       
23.
       
       
24.
       
       
25.
       
       
26.
       
       
27.
       
       
28.
       
       
29.
       
       
30.
       
       
31.
       
       
32.
       
       
33.
       
       
34.
       
       
35.
       
       
36.
       
       
37.
       
       
38.
       
       
39.
       
       
40.
       
       
41.
       
       
42.
       
       
43.
       
       
44.
       
       
45.
       
       
46.