Josh Morrison
Josh Morrison

Reputation: 7636

set of string permutation problem

I got this set of string such as "12 13 2 1 444"

I want to generate all of different permutation of this set of integers.

I mean

"12 13 2 1 444"
"13 12 2 1 444"
"12 13 1 2 444"
"1 12 13 2 444"
.....

Could any one help me with Java?

Upvotes: 0

Views: 988

Answers (2)

templatetypedef
templatetypedef

Reputation: 372814

There are many ways to do this. I think that the best way is to break this down into two steps:

  1. Break the string down into its component parts.
  2. Generate all permutations of those parts.

You can split the string into individual values by using the String.split method:

String[] allParts = inputString.split(' ');

Once you have this, you can generate all permutations with one of many permutation generation functions. Leon's link will probably help out here.

Upvotes: 2

Leon
Leon

Reputation: 1141

you need to do it recursively. Check http://programminggeeks.com/recursive-permutation-in-java/ as a guide

Upvotes: 1

Related Questions