Databases
StackOverflow2013
Postsdbo
POC++/C/Java: Anagrams - from original string to target;
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POC++/C/Java: Anagrams - from original string to target;
    primarykey
    data
    text
    <p>I'm trying to solve this problem : <a href="http://uva.onlinejudge.org/external/7/732.html" rel="nofollow noreferrer">http://uva.onlinejudge.org/external/7/732.html</a>. For the given example, they give us the original word, for example <strong>TRIT</strong> and the target "anagramed" string, <strong>TIRT</strong>.</p> <p><strong>Objective:</strong> We have to output all the valid sequences of 'i' and 'o' (push and pop's, respectively) which produce the target string from the source string.</p> <p>So, I was thinking of calculate all permutations of "i" and "o" , but cutting this cases: </p> <p><strong>1)</strong> if current permutation begins with an 'o', stop checking, since all the of the next permutations will begin with this pop command and popping something from an empty stack is an invalid command.</p> <p><strong>2)</strong> if an 'o' command is found in the middle of the checking and there is nothing in the stack, skip that case.</p> <p><strong>3)</strong> if an 'i' command is found and there is nothing in the input string, skip that case.</p> <p><strong>4)</strong> if an 'o' command is found and currently expected character is not the character just popped out, then skip that case, since this will never reach to the target string.</p> <p><strong>5)</strong> don't search if the input and target strings have different lengths. </p> <p>but I think it might get me TLE anyway...</p> <p>I know the theory: permutations perhaps and backtracking all the way. I just have too many difficulties implementing it.</p> <p>could anyone please share with me some code and or ideas please?</p> <p>P.S.: Any suggestion that may decrease some execution time will be welcome , of course.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USneverMind
    1. USneverMind
    plurals
    1. This table or related slice is empty.
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POC++/C/Java: Anagrams - from original string to target;
      1. USultrajohn
      1. VTFavorite
    2. VO
      singulars
      1. POC++/C/Java: Anagrams - from original string to target;
      1. USCam
      1. VTFavorite
    3. VO
      singulars
      1. POC++/C/Java: Anagrams - from original string to target;
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload