Print all possible strings of length k that can be formed from a set of n characters

最新推荐文章于 2024-11-18 21:13:50 发布

原创最新推荐文章于 2024-11-18 21:13:50 发布 · 592 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 2 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

本文介绍了一种算法，该算法能够从给定字符集中生成所有可能的特定长度的字符串组合。通过递归方法实现了字符串的生成，并展示了如何使用C++实现这一功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a set of characters and a positive integer k, print all possible strings of length k that can be formed from the given set.

Examples:

Input: set[] = {'a', 'b'}, k = 3Output:aaaaababaabbbaababbbabbbInput: set[] = {'a', 'b', 'c', 'd'}, k = 1Output:abcd

Given a set of characters and a positive integer k, print all possible strings of length k that can be formed from the given set.

Examples:

Input: 
set[] = {'a', 'b'}, k = 3

Output:
aaa
aab
aba
abb
baa
bab
bba
bbb


Input: 
set[] = {'a', 'b', 'c', 'd'}, k = 1
Output:
a
b
c
d

Input: set[] = {'a', 'b'}, k = 3Output:aaaaababaabbbaababbbabbbInput: set[] = {'a', 'b', 'c', 'd'}, k = 1Output:abcd

// main.cpp

// stringOutput

// Created by Libin Liang on 1/26/15.

#include <iostream>

#include <string>

#include <vector>

using namespace std;

void printVtr(vector<char> &vtr)

{

for (int i=0; i<vtr.size(); i++)

printf ("%c ", vtr[i]);

printf("\n");

return;

}

void foo(string str, int k, vector<char> &vtr)

{

if (k == 0)

{

printVtr(vtr);

return;

}

for (int i=0; i<str.size(); i++)

{

vtr.push_back(str.at(i));

foo(str, k-1, vtr);

vtr.pop_back();

}

void outputString(string str, int k)

{

if (str.size() == 0 || k <= 0)

return;

vector<char> vtr;

for (int i=0; i<str.size(); i++)

{

vtr.push_back(str.at(i));

foo(str, k-1, vtr);

vtr.pop_back();

}

return;

}

int main(int argc, const char * argv[]) {

outputString("ab", 3);

return 0;

}

Input: set[] = {'a', 'b'}, k = 3Output:aaaaababaabbbaababbbabbbInput: set[] = {'a', 'b', 'c', 'd'}, k = 1Output:abcd