72.挖掘CSDN密码到链表并统计密码出现次数生成密码库

• list.h

   #define  _CRT_SECURE_NO_WARNINGS
   #include <stdio.h>
   #include <stdlib.h>
   #include <string.h>
  
   //创建密码结点
   typedef struct passinfo
   {
       //密码
       char password[];
       //出现次数
       int ci;
       //下一个节点
       struct passinfo *pNext;
   }INFO, *PINFO;
  
   //头部插入
   PINFO addback(PINFO phead, char password[]);
   //按照次数排序
   PINFO sortbyci(PINFO phead);
   //按照密码排序
   PINFO sortbypass(PINFO phead);
   //显示数据
   PINFO show(PINFO phead);
   //判断存在与否
   int isin(PINFO phead, char password[]);
   //写入到文件
   void writetofile(PINFO phead, char path[]);

• list.c

   #include "list.h"
  
   //头部插入
   PINFO addback(PINFO phead, char password[])
   {
       //开辟内存
       PINFO pnew = calloc(, sizeof(INFO));
       //拷贝密码
       strcpy(pnew->password, password);
       //初始化
       pnew->ci = ;
       pnew->pNext = NULL;
       //如果头结点为空直接插入
       if (phead ==NULL)
       {
           phead = pnew;
       }
       //否则头部插入
       else
       {
           pnew->pNext = phead;
           phead = pnew;
       }
       return phead;
   }
  
   //按照密码次数排序
   PINFO sortbyci(PINFO phead)
   {
       //冒泡排序法,一共冒泡这么多次
       for (PINFO p1 = phead; p1 != NULL;p1=p1->pNext)
       {
           for (PINFO p2 = phead; p2 != NULL; p2 = p2->pNext)
           {
               if (p2->pNext!=NULL)
               {
                   //如果次数小则进行交换
                   if (p2->ci < p2->pNext->ci)
                   {
                       //交换数据
                       int citemp = p2->ci;
                       p2->ci = p2->pNext->ci;
                       p2->pNext->ci = citemp;
  
                       char passtemp[];
                       strcpy(passtemp, p2->password);
                       strcpy(p2->password, p2->pNext->password);
                       strcpy(p2->pNext->password, passtemp);
                   }
               }
           }
       }
   }
  
   //按照密码排序
   PINFO sortbypass(PINFO phead)
   {
       //冒泡排序
       for (PINFO p1 = phead; p1 != NULL; p1 = p1->pNext)
       {
           for (PINFO p2 = phead; p2 != NULL; p2 = p2->pNext)
           {
               if (p2->pNext != NULL)
               {
                   if (strcmp(p2->password, p2->pNext->password) < )
                   {
                       //交换数据
                       int citemp = p2->ci;
                       p2->ci = p2->pNext->ci;
                       p2->pNext->ci = citemp;
  
                       char passtemp[];
                       strcpy(passtemp, p2->password);
                       strcpy(p2->password, p2->pNext->password);
                       strcpy(p2->pNext->password, passtemp);
  
                   }
               }
           }
       }
   }
  
   //显示数据
   PINFO show(PINFO phead)
   {
       if (phead==NULL)
       {
           return;
       }
       else
       {
           printf("%s,%d\n", phead->password, phead->ci);
           show(phead->pNext);
       }
       return phead;
   }
  
   //判断密码是否存在
   int isin(PINFO phead, char password[])
   {
       PINFO p = phead;
       while (p!=NULL)
       {
           if (strcmp(p->password,password)==)
           {
               p->ci += ;
               return ;
           }
           p = p->pNext;
       }
  
       return ;//不在链表内部
   }
  
   //写入到文件
   void writetofile(PINFO phead, char path[])
   {
       FILE *pf = fopen(path, "w");
       PINFO p = phead;
       while (p != NULL)
       {
           //格式化打印到文件
           fprintf(pf, "%s %d\n", p->password, p->ci);
           p = p->pNext;
       }
       fclose(pf);
   }

• main.c

   #include "list.h"
   #include <Windows.h>
   PINFO phead = NULL;
  
   //是否满足格式要求   账号 # 密码 # 邮箱
   int isoktosscanf(char *str)
   {
       //判断是否存在#
       char *p = strstr(str, "#");
       if (p!=NULL)
       {
           //继续判断是否存在第二个#
           if (strstr(p+,"#")!=NULL)
           {
               return ;
           }
           else
           {
               return ;
           }
       }
       else
       {
           return ;
       }
   }
  
   //消除空格
   void eatspace(char *str)
   {
       //当前位置
       int i = ;
       //游标
       int j = ;
       //双指针错位
       while ((str[i]=str[j++])!='\0')
       {
           if (str[i]!=' ')
           {
               i++;
           }
       }
   }
  
   //文件载入
   void fileload()
   {
       //打开文件
       FILE *pf = fopen("csdn.txt", "r");
  
       //如果没有到文件末尾
       while (!feof(pf))
       {
           char str[] = {  };
           char password[] = {  };
           //从文件中获取一行
           fgets(str, , pf);
           //找到第一个#的位置
           char*p1 = strstr(str, "#");
           //找到第二个#的位置
           char*p2 = strstr(p1+, "#");
           //分别设置成'\0'
           *p1 = '\0';
           *p2 = '\0';
           //拷贝字符串
           strcpy(password, p1 + );
           //消除空格
           eatspace(password);
           //判断是否在链表中
           if (isin(phead, password) == )
           {
               //添加到头结点
               phead = addback(phead, password);
           }
       }
       fclose(pf);
  
       //按密码次数排序
       sortbyci(phead);
       //写入到文件
       writetofile(phead, "C:\\ci.txt");
       //按照密码相似度排序
       sortbypass(phead);
       //写入到文件
       writetofile(phead, "C:\\pass.txt");
   }
  
   //main函数
   void main4()
   {
       fileload();
       system("pause");
   }