Question

I want to convert the recursive function given below:

 LinkedList i=a; //a contains the nodes which are adjacent to the last element of g
 for(String i1: i )
{
  if(g.contains(i1) || i1.equals("o"))
   { continue; }
  g.addLast(i1);
  func(g);
  g.removeLast();
}

I want to convert the above program to an iterative one. Can someone help

Answer 1

LinkedList i=a; //a contains the nodes which are adjacent to the last element of g
   for(String i1: i )
   {
      if(g.contains(i1) || i1.equals("o"))
       { continue; }
      g.addLast(i1);
      func(g);
      g.removeLast();
   }

So walking through this it appears as though the steps are as follows:
1) Check for existence of current String or if it equals “o”
2a) If yes continue
2b) else put current string at end of list.
3) repeat steps 1->2
4) remove the last element of the list

If I were to make the code as simple as possible given those steps it would look like so:

func(LinkedList ll)  
{  

    Set set = new HashSet(ll);  //removes all duplicates  
    if(set.contains("o")  {  set.remove("o") ;}  //these are strings so that works
    LinkedList newLL = new LinkedList(set);  //order still retained  
    newLL.poll();  //remove last element
}