Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>You could implement this using a <code>Hashtable</code>. Using your code as a base, I've written an example implementation but without knowing what it is you are trying to do, I can't judge if this is what you are looking for. </p> <pre><code>import java.util.Hashtable; public class findPat { static final int COUNT = 100; static Hashtable&lt;String, Integer&gt; compareSet = new Hashtable&lt;String, Integer&gt;(); static String groupInteger = ""; static int arr [] = new int [5]; static int st = 1; static int end = 56; static double t1; static double t2; public static void main(String[] args) { t1=System.currentTimeMillis(); for(int n = 0; n &lt; COUNT; n++){ for (int i = 0; i &lt; arr.length; i++) { arr[i] = (int) (Math.random()* (end - st + 1)) + st; } for (int i = 1; i &lt;= 5; i++) { groupInteger += arr[i-1]; System.out.print("\t" + arr[i-1]); if (i % 5 == 0) { System.out.println(); if (compareSet.containsKey(groupInteger)) { System.out.println("duplicate found"); int currentCount = compareSet.get(groupInteger); compareSet.put(groupInteger, currentCount + 1); } else { compareSet.put(groupInteger, 1); } groupInteger = ""; } } } t2=System.currentTimeMillis(); System.out.println(); System.out.println(); System.out.println("\t" + "Total run time is " + ((t2 - t1)) + "ms"); } } </code></pre> <p>This code keeps track of the unique sets of random numbers by adding them (creating a key value that is the same for every set that has the same values in the same order, the concatenated string takes care of this). </p> <p>Your code ran in 13 seconds on my system, mine takes 17 seconds. Now if runtime is of crucial importance, you might want to look into hashing techniques. But I'm not sure if you will be able to shave off a lot as you will have to add some extra code which will take extra time. </p>
    singulars
    1. This table or related slice is empty.
    1. POHow to find a duplicate of length 5 in a single array. Java
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USlen
    1. USlen
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POHow to find a duplicate of length 5 in a single array. Java
      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. VTAcceptedByOriginator
    1. COThis is not 100% but it does put me in the right direction, Thank you very much.
      singulars
      1. PO
      1. USEric Goncalves
    2. COI ran the program but, when i print compareSet to see which values are duplicated i get this {3623955=1, 311471043=1, 191644650=1, 2754351=1, 34492846=1, 431540317=1, 5=1, 3649244028=1, 748465055=1, 1141473319=1} but the numbers don't match up to what is in the array, it starts from an arbitrary spot in the array.
      singulars
      1. PO
      1. USEric Goncalves
    3. COsorry, my mistake, I assumed your code prints after every fifth item in the array but due to i%5 being 0 only when a number is dividable by 5 and the fifth element having index 4, it stores the first element followed by sets of elements 5 positions further (2nd-6th, 7ht-11th, ...). I've edited my code.
      singulars
      1. PO
      1. USlen
 

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