debut verif orthographe -OK 1 mot

Thorsieger
1 parent 131759ee
Showing 3 changed files with 43 additions and 1 deletions Show diff stats
find.c
find.h
main.c
@@ -0,0 +1,31 @@
+#include "find.h"
+
+
+int find_mot(struct node **tab_ptr_tree,char mot[],int size,int fl)
+{
+    if(size==0 || (size==1 && tab_ptr_tree[fl]!=NULL))return 0;//vrais
+    if(size==1 && tab_ptr_tree[fl]==NULL)return 1;//faux
+
+    struct node *ptr_node = tab_ptr_tree[fl];
+    for(int i=1;i<size;i++)
+    {
+        if(ptr_node->nbr_fils==0)return 1;
+        for(int k=0;k<(ptr_node->nbr_fils);k++)
+        {
+            //if(ptr_node->fils[k]->nbr_fils==0)return 1;
+            if(ptr_node->fils[k]->val==mot[i])
+            {
+                ptr_node=ptr_node->fils[k];
+                break;
+            }
+        }
+    }
+
+    if(ptr_node->fin==0)return 1;
+    else return 0;
+}
+
+int find()
+{
+    return 0;
+}
 \ No newline at end of file
@@ -0,0 +1,5 @@
+#include "tree.h"
+
+int find();
+
+int find_mot(struct node **,char*,int,int);
 \ No newline at end of file
-#include "tree.h"
 #include "find.h"
  
 int main()
@@ -19,6 +18,13 @@ int main()
  
   printf("Loading done!\n");
  
+  char mot[] = "aaa";
+  int taille = 3;
+  int result;
+  result = find_mot(tab,mot,taille,0);
+  printf("%d\n",result);
+
+
   free_dico(tab);//libérer la mémoire
   fclose(fp);