• Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other Pie Elite all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Tim Cooke
  • Devaka Cooray
  • Ron McLeod
  • Jeanne Boyarsky
Sheriffs:
  • Liutauras Vilda
  • paul wheaton
  • Junilu Lacar
Saloon Keepers:
  • Tim Moores
  • Stephan van Hulst
  • Piet Souris
  • Carey Brown
  • Tim Holloway
Bartenders:
  • Martijn Verburg
  • Frits Walraven
  • Himai Minh

2d Arrays Combination

 
Ranch Hand
Posts: 63
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
Hi,

I have this problem, given N arrays I have to get the possible combinations of this arrays in an example like this:

String[] array1 = {1,2,3};
String[] array2 = {A,B,C};
String[] array3 = {$,&,%};

Will result in an array or vector like this:

String[] resultsArray = {1,2,3,A,B,C,$,&,%,1A,1B,1C, 2A, 2B, 2C, 3A, 3B, 3C, 1A$, etc}

I understand that I have to make a recursive call to a method but I'm kind of stuck here, any help we'll be welcome:


I have tried to solve this problem like this:


 
Climb the rope! CLIMB THE ROPE! You too tiny ad:
the value of filler advertising in 2021
https://coderanch.com/t/730886/filler-advertising
reply
    Bookmark Topic Watch Topic
  • New Topic