Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>There's a simple solution that's much more efficient. Find the first and last occurrence of the substring and you have your answer. No need to search for all occurrences.</p> <pre><code>public int strDist(String str, String sub) { int first = str.indexOf(sub); if (first == -1) return 0; int last = str.lastIndexOf(sub); return last - first + sub.length(); } </code></pre> <p><a href="http://ideone.com/3mgbK" rel="nofollow">http://ideone.com/3mgbK</a></p> <p>The problem with your code is that you are returning the index of the last occurrence of the substring. You appear to be trying to find the 2nd last occurrence as well, and your last line should be <code>max - previous</code> at the least, but then you'd also need to add the length of the substring making it <code>max - previous + sub.length()</code>. You also need to move the declaration of <code>previous</code> outside the while loop. But then you're finding the distance between the 2nd last and last occurrences, which will fail if there aren't exactly 2 occurrences (e.g. <code>"foocatbar"</code> or <code>"catfoocatbarcat"</code>).</p> <p>Solving this recursively is a bit overkill, first and foremost because you cannot use the builtin <code>String.indexOf()</code> function. But since this is homework, here's a quick attempt:</p> <pre><code>public static int indexOf(String str, String sub, int start, int direction) { if (start &lt; 0 || start &gt; str.length() - sub.length()) return -1; if (str.substring(start, start + sub.length()).equals(sub)) return start; return indexOf(str, sub, start+direction, direction); } public static int strDistRecursive(String str, String sub) { int first = indexOf(str, sub, 0, 1); if (first == -1) return 0; int last = indexOf(str, sub, str.length() - sub.length(), -1); return last - first + sub.length(); } </code></pre> <p><a href="http://ideone.com/f6bok" rel="nofollow">http://ideone.com/f6bok</a></p>
    singulars
    1. This table or related slice is empty.
    1. POCompute the length of largest substring that starts and ends with the same substring
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USmarcog
    1. USmarcog
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POCompute the length of largest substring that starts and ends with the same substring
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. CO@marcog,could you please let me know how do i do that.confused :-(
      singulars
      1. PO
      1. USDeepak
    2. CO@Deepak See code I just added.
      singulars
      1. PO
      1. USmarcog
    3. COits not working. strDist("catcowcat", "cat") → 9 3 FAIL,your solution works if it occurs only once.not for all cases
      singulars
      1. PO
      1. USDeepak
 

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