Substrings of a string without nested loops

Asked May 12 '15 at 07:14

Active May 12 '15 at 07:19

Viewed 120 times

I need to do some complex work on all substrings of the given string, for which I need to find all substrings of the given string. I am wondering if it is possible to do without nested loops (n^2 complexity)?

Any other suggestions on optimizing this?

int originalStringlength = str.length();
for(int start = 0 ; start < originalStringlength ; start++){
   for(int chars = 1; chars <= originalStringlength - start; chars++){
      String substr = str.substring(start, start+chars);
      System.out.prinln("Substring: " +  substr);
    //do further processing
   }    
}

edited May 12 '15 at 07:17

Andy Turner

122,430
10
138
216

asked May 12 '15 at 07:14

Manish

1,355
2
14
27

1

Surely there are `O(n^2)` substrings though, meaning that you need an `O(n^2)` algorithm if you want to print them all? – Andy Turner May 12 '15 at 07:15
It is the same question as: http://stackoverflow.com/questions/2560262/generate-all-unique-substrings-for-given-string – Veselin Davidov May 12 '15 at 07:18
You could replace a for with a while! :) – T30 May 12 '15 at 07:21
Right! Thanks for pointing out - my search didn't show that! :( – Manish May 12 '15 at 07:21

Substrings of a string without nested loops

0 Answers0