深度優先搜尋—C—python__python

深度優先搜尋的基本模型：

void dfs(int step) {     判斷邊界            嘗試每一種可能for(i=1;i<=n;i++)           {                 繼續下一步 dfs(step+1);           }          返回 }

任務：深度優先搜尋，把1-n放入n個盒子裡，有幾种放法*

C實現

#include<stdio.h>int n,book[10],a[10];void dfs(int step){    int i;    if(step==n+1)    {        for(i=1;i<=n;i++)            printf("%d ",a[i]);        printf("\n");        return;    }    for(i=1;i<=n;i++)    {        if(book[i]==0)        {            a[step]=i;            book[i]=1;            dfs(step+1); //繼續搜尋直到完成一种放法            book[i]=0;   //歸零才能進行下一次嘗試        }    }    return;}int main(){    scanf("%d",&n);    dfs(1);    return 0;}

python實現

def depth_first_box(step):    if step == n+1:        for i in range(1, n+1):            print(lists[i], end=' ')        print('\n')        return    for j in range(1, n+1):        if book[j]==0:            book[j]=1            lists[step]=j            depth_first_box(step+1)            book[j]=0    returnif __name__=='__main__':    lists = [0] * 11    book = [0] * 11    n = int(input("輸入n:"))    depth_first_box(1)