c++ - 输入所有子文件夹 - 递归

标签 c++ c recursion

如何编写一个程序来进入文件夹的所有子文件夹?
我写了一些代码,但它没有进入子文件夹。

void main(int argc, char *argv[])
{
char* dirPath = argv[1];
struct stat statbuf;
DIR *dir;
struct dirent *ent;
size_t arglen = strlen(argv[1]);

if ((dir = opendir (dirPath)) != NULL) {
    while ((ent = readdir (dir)) != NULL) {
        printf(ent->d_name, "%s\n");
    }
    closedir (dir);
} else {
    perror ("Problem");
   }
}

我尝试递归地使用 stat() 函数。

最佳答案

http://www.lemoda.net/c/recursive-directory/

#include <stdlib.h>
#include <stdio.h>
#include <sys/types.h>
#include <string.h>
#include <errno.h>
/* "readdir" etc. are defined here. */
#include <dirent.h>
/* limits.h defines "PATH_MAX". */
#include <limits.h>

/* List the files in "dir_name". */

static void
list_dir (const char * dir_name)
{
    DIR * d;

    /* Open the directory specified by "dir_name". */

    d = opendir (dir_name);

    /* Check it was opened. */
    if (! d) {
        fprintf (stderr, "Cannot open directory '%s': %s\n",
                 dir_name, strerror (errno));
        exit (EXIT_FAILURE);
    }
    while (1) {
        struct dirent * entry;
        const char * d_name;

        /* "Readdir" gets subsequent entries from "d". */
        entry = readdir (d);
        if (! entry) {
            /* There are no more entries in this directory, so break
               out of the while loop. */
            break;
        }
        d_name = entry->d_name;
        /* Print the name of the file and directory. */
    printf ("%s/%s\n", dir_name, d_name);

#if 0
    /* If you don't want to print the directories, use the
       following line: */

        if (! (entry->d_type & DT_DIR)) {
        printf ("%s/%s\n", dir_name, d_name);
    }

#endif /* 0 */


        if (entry->d_type & DT_DIR) {

            /* Check that the directory is not "d" or d's parent. */

            if (strcmp (d_name, "..") != 0 &&
                strcmp (d_name, ".") != 0) {
                int path_length;
                char path[PATH_MAX];

                path_length = snprintf (path, PATH_MAX,
                                        "%s/%s", dir_name, d_name);
                printf ("%s\n", path);
                if (path_length >= PATH_MAX) {
                    fprintf (stderr, "Path length has got too long.\n");
                    exit (EXIT_FAILURE);
                }
                /* Recursively call "list_dir" with the new path. */
                list_dir (path);
            }
    }
    }
    /* After going through all the entries, close the directory. */
    if (closedir (d)) {
        fprintf (stderr, "Could not close '%s': %s\n",
                 dir_name, strerror (errno));
        exit (EXIT_FAILURE);
    }
}

int main ()
{
    list_dir ("/usr/share/games");
    return 0;
}

关于c++ - 输入所有子文件夹 - 递归,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/30244338/

相关文章:

python - 为什么我的递归不起作用?警告 : Project Euler spoiler

C++14 非聚合的统一初始化

c++ - 为什么构造函数使用错误的参数?

c - EAGAIN 是什么意思?

从链表创建一个数组并对该数组进行排序 C

javascript - 变量偶尔不生成: max call stack size issue

c++ - Raspbian (Raspberry Pi 3) 的最新版本的 GraphicsMagick

c++ - 使用空间索引库批量加载 R* 树

c - 为什么 malloc 分配的字节数与请求的字节数不同?

Python (3.4) 字典/树扁平化时未调用递归函数