Styjun

How to travel to Japan while expressing milk?

Is it possible to create a QR code using text?

Standard deduction V. mortgage interest deduction - is it basically only for the rich?

Can a virus destroy the BIOS of a modern computer?

Pact of Blade Warlock with Dancing Blade

Processor speed limited at 0.4 Ghz

Why were 5.25" floppy drives cheaper than 8"?

Are British MPs missing the point, with these 'Indicative Votes'?

GFCI outlets - can they be repaired? Are they really needed at the end of a circuit?

How do I exit BASH while loop using modulus operator?

Why didn't Boeing produce its own regional jet?

How seriously should I take size and weight limits of hand luggage?

Do Iron Man suits sport waste management systems?

Why was the shrink from 8″ made only to 5.25″ and not smaller (4″ or less)

files created then deleted at every second in tmp directory

My ex-girlfriend uses my Apple ID to login to her iPad, do I have to give her my Apple ID password to reset it?

Blending or harmonizing

Did 'Cinema Songs' exist during Hiranyakshipu's time?

What is a Samsaran Word™?

What is required to make GPS signals available indoors?

In the UK, is it possible to get a referendum by a court decision?

Placement of More Information/Help Icon button for Radio Buttons

Implication of namely

Am I breaking OOP practice with this architecture?

Comparing TreeMap of ArrayLists

Create ArrayList from arrayWhen to use LinkedList over ArrayList in Java?How to get the last value of an ArrayListInitialization of an ArrayList in one lineComparing Java enum members: == or equals()?Sort ArrayList of custom Objects by propertyDifference between HashMap, LinkedHashMap and TreeMapConverting 'ArrayList<String> to 'String[]' in JavaConvert ArrayList<String> to String[] arrayhow to count an element in each index of Arraylist in c#

-1

So I'm doing something kind of funky...
I have a a TreeMap of ArrayLists. <Integer, ArrayList<Integer>>
I need to compare the each ArrayList to see if there is a common element.

How would I do this?

Here is what I think in theory should work, but its no go.

 for(int i = 1; i < treemap.size(); i++)
 //cycle this users movies "j"
 for(int j=2; j < currentArray.size(); j++)
 compareArray = treemap.get(j);
 //cylce next users movies "k"
 for(int k=1; k<compareArray.size(); k++)
 if(currentArray.get(i) == compareArray.get(k))
 if (treemap.containsKey(i))
 ArrayList<Integer> list3 = treemap.get(i);
 list3.add(currentArray.get(j));
 treemap2.remove(i);
 treemap2.put(i, list3);
 
 if (!treemap.containsKey(i))
 ArrayList<Integer> list4 = new ArrayList<Integer>();
 list4.add(currentArray.get(j));
 treemap2.put(i, list4);

 
 
 
 
 currentArray = treemap.get(i+1);
 

java arraylist treemap

share|improve this question

edited Mar 22 at 1:39

Hooch

asked Mar 21 at 20:32

HoochHooch

257

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  You have to first attempt something. If it doesn't work, then you post the code, error message, actual vs. expected behavior
  
  – Juan Mendes
  Mar 21 at 20:35
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  Yes, I'm aware to try something... But I can't begin to picture a starting point.
  
  – Hooch
  Mar 21 at 20:41
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  map.values() gets you all the ArrayList<Integer>'s. That's your starting point
  
  – Not a JD
  Mar 21 at 20:42
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  So I updated my post with what I believe should be working... I'd imagine it's something stupid, or maybe I just have a bad idea all around.
  
  – Hooch
  Mar 22 at 1:40
  

  
  
  
  

add a comment | 

-1

So I'm doing something kind of funky...
I have a a TreeMap of ArrayLists. <Integer, ArrayList<Integer>>
I need to compare the each ArrayList to see if there is a common element.

How would I do this?

Here is what I think in theory should work, but its no go.

 for(int i = 1; i < treemap.size(); i++)
 //cycle this users movies "j"
 for(int j=2; j < currentArray.size(); j++)
 compareArray = treemap.get(j);
 //cylce next users movies "k"
 for(int k=1; k<compareArray.size(); k++)
 if(currentArray.get(i) == compareArray.get(k))
 if (treemap.containsKey(i))
 ArrayList<Integer> list3 = treemap.get(i);
 list3.add(currentArray.get(j));
 treemap2.remove(i);
 treemap2.put(i, list3);
 
 if (!treemap.containsKey(i))
 ArrayList<Integer> list4 = new ArrayList<Integer>();
 list4.add(currentArray.get(j));
 treemap2.put(i, list4);

 
 
 
 
 currentArray = treemap.get(i+1);
 

java arraylist treemap

share|improve this question

edited Mar 22 at 1:39

Hooch

asked Mar 21 at 20:32

HoochHooch

257

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  You have to first attempt something. If it doesn't work, then you post the code, error message, actual vs. expected behavior
  
  – Juan Mendes
  Mar 21 at 20:35
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  Yes, I'm aware to try something... But I can't begin to picture a starting point.
  
  – Hooch
  Mar 21 at 20:41
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  map.values() gets you all the ArrayList<Integer>'s. That's your starting point
  
  – Not a JD
  Mar 21 at 20:42
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  So I updated my post with what I believe should be working... I'd imagine it's something stupid, or maybe I just have a bad idea all around.
  
  – Hooch
  Mar 22 at 1:40
  

  
  
  
  

add a comment | 

So I'm doing something kind of funky...
I have a a TreeMap of ArrayLists. <Integer, ArrayList<Integer>>
I need to compare the each ArrayList to see if there is a common element.

How would I do this?

Here is what I think in theory should work, but its no go.

 for(int i = 1; i < treemap.size(); i++)
 //cycle this users movies "j"
 for(int j=2; j < currentArray.size(); j++)
 compareArray = treemap.get(j);
 //cylce next users movies "k"
 for(int k=1; k<compareArray.size(); k++)
 if(currentArray.get(i) == compareArray.get(k))
 if (treemap.containsKey(i))
 ArrayList<Integer> list3 = treemap.get(i);
 list3.add(currentArray.get(j));
 treemap2.remove(i);
 treemap2.put(i, list3);
 
 if (!treemap.containsKey(i))
 ArrayList<Integer> list4 = new ArrayList<Integer>();
 list4.add(currentArray.get(j));
 treemap2.put(i, list4);

 
 
 
 
 currentArray = treemap.get(i+1);
 

java arraylist treemap

share|improve this question

edited Mar 22 at 1:39

Hooch

asked Mar 21 at 20:32

HoochHooch

257

 for(int i = 1; i < treemap.size(); i++)
 //cycle this users movies "j"
 for(int j=2; j < currentArray.size(); j++)
 compareArray = treemap.get(j);
 //cylce next users movies "k"
 for(int k=1; k<compareArray.size(); k++)
 if(currentArray.get(i) == compareArray.get(k))
 if (treemap.containsKey(i))
 ArrayList<Integer> list3 = treemap.get(i);
 list3.add(currentArray.get(j));
 treemap2.remove(i);
 treemap2.put(i, list3);
 
 if (!treemap.containsKey(i))
 ArrayList<Integer> list4 = new ArrayList<Integer>();
 list4.add(currentArray.get(j));
 treemap2.put(i, list4);

 
 
 
 
 currentArray = treemap.get(i+1);
 

share|improve this question

edited Mar 22 at 1:39

Hooch

asked Mar 21 at 20:32

HoochHooch

257

share|improve this question

edited Mar 22 at 1:39

Hooch

asked Mar 21 at 20:32

HoochHooch

257

asked Mar 21 at 20:32

HoochHooch

257

asked Mar 21 at 20:32

HoochHooch

257