n個數的全排列C語言遞迴 (回溯)back-tracking

來源:互聯網
上載者:User
#include <stdio.h>#include <string.h>int n, a[100];int used[100];int num[100];void dfs( int x ){int i;if( x >= n ){for( i = 0; i < n; i++ )printf( "%d ", num[i] );printf( "\n" );}else{for( i = 0; i < n; i++ )if( !used[i] ){num[x] = a[i];used[i] = 1;dfs( x+1 );used[i] = 0;}}return ;}int main(){int i;memset( used, 0, sizeof(used) );printf( "此程式為遞迴進行n個整數的全排列(n<100),");printf( "一共有多少個數?\n");scanf( "%d", &n );for( i = 0; i < n; i++ ){printf( "第%d個:" );scanf( "%d", &a[i] );}dfs( 0 );return 0;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.