Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Here's the implementation that occurs to me.</p> <pre><code>//Implementing here with two List&lt;String&gt; //Should be easy enough to use arrays, or streams, or whatever. public static int getShortestSubseqWith(List&lt;String&gt; text, List&lt;String&gt; words) { int minDistance = Integer.MAX_VALUE; //Create a map of the last known position of each word Map&lt;String, Integer&gt; map = new HashMap(); for (String word : words) { map.put(word, -1); } String word; //One loop through the main search string for (int position = 0; position &lt; text.size(); position++){ word = text.get(position); //If the current word found is in the list we're looking for if (map.containsKey(word)) { //Update the map map.put(word, position); //And if the current positions are the closest seen so far, update the min value. int curDistance = getCurDistance(map); if (curDistance &lt; minDistance) minDistance = curDistance; } } return minDistance; } //Get the current distance between the last known position of each value in the map private static int getCurDistance(Map&lt;String, Integer&gt; map) { int min = Integer.MAX_VALUE; int max = 0; for (Integer value : map.values()) { if (value == -1) return Integer.MAX_VALUE; else { max = Math.max(max,value); min = Math.min(min,value); } } return max - min; } </code></pre> <p>The main performance influence here, if hits are relatively sparse, and list of terms to search for relatively small, should just be the loop over the <code>text</code> to be searched. If hits are very frequent, performance may suffer, due to more frequent runs through <code>getCurDistance</code>.</p>
    singulars
    1. This table or related slice is empty.
    1. POmethod to find the shortest substring containing the given words:optimization required
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USfemtoRgon
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    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
    1. COMy function fails(times out) because of the large number of the subsegments that are generated. Still I think,using list and the tree traversal should reduce the time instead of my poor array scanning, in which case should solve my problem. Thanks a lot :). Will mark the answer correct after checking the solution. ;)
      singulars
      1. PO
      1. USSushim Mukul Dutta
    2. COThis code does not fully answer the question. It returns the minimum distance found, but cannot print the actual matched sequence since *map* might get updated after containing the shortest sequence.
      singulars
      1. PO
      1. USBarry NL
 

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