给定一个字符串,您需要打印所有可能的字符串,方法是在它们之间放置空格(零或一)
例子 :
Input : str[] = "ABC"
Output : ABC
AB C
A BC
A B C
Input : str[] = "ABCD"
Output : ABCD
A BCD
AB CD
A B CD
ABC D
A BC D
AB C D
A B C D
如果仔细研究,我们会发现该问题归结为Power Set问题。我们基本上需要生成所有子集,其中每个元素都是不同的空间。
C++
// C++ program to print all strings that can be
// made by placing spaces
#include
using namespace std;
void printSubsequences(string str)
{
int n = str.length();
unsigned int opsize = pow(2, n - 1);
for (int counter = 0; counter < opsize; counter++) {
for (int j = 0; j < n; j++) {
cout << str[j];
if (counter & (1 << j))
cout << " ";
}
cout << endl;
}
}
// Driver code
int main()
{
string str = "ABC";
printSubsequences(str);
return 0;
}
Java
// Java program to print all strings that can be
// made by placing spaces
import java.util.*;
class GFG
{
static void printSubsequences(String s)
{
char[] str= s.toCharArray();
int n = str.length;
int opsize = (int)(Math.pow(2, n - 1));
for (int counter = 0; counter < opsize; counter++) {
for (int j = 0; j < n; j++) {
System.out.print(str[j]);
if ((counter & (1 << j)) > 0)
System.out.print(" ");
}
System.out.println();
}
}
// Driver code
public static void main(String[] args)
{
String str = "AB";
printSubsequences(str);
}
}
/* This code is contributed by Mr. Somesh Awasthi */
Python3
# Python 3 program to print all strings
# that can be made by placing spaces
from math import pow
def printSubsequences(str):
n = len(str)
opsize = int(pow(2, n - 1))
for counter in range(opsize):
for j in range(n):
print(str[j], end = "")
if (counter & (1 << j)):
print(" ", end = "")
print("\n", end = "")
# Driver code
if __name__ == '__main__':
str = "ABC"
printSubsequences(str)
# This code is contributed by
# Sanjit_Prasad
C#
// C# program to print all strings
// that can be made by placing spaces
using System;
class GFG {
// Function to print all subsequences
static void printSubsequences(String s)
{
char[] str= s.ToCharArray();
int n = str.Length;
int opsize = (int)(Math.Pow(2, n - 1));
for (int counter = 0; counter < opsize;
counter++)
{
for (int j = 0; j < n; j++)
{
Console.Write(str[j]);
if ((counter & (1 << j)) > 0)
Console.Write(" ");
}
Console.WriteLine();
}
}
// Driver code
public static void Main()
{
String str = "ABC";
printSubsequences(str);
}
}
// This code is contributed by shiv_bhakt.
PHP
Javascript
输出 :
ABC
A BC
AB C
A B C