Hey guys, does anyone know how to find the number of unique values in a 2 dimensional array.
For example: an array containing the numbers 1, 2, 3, 4, 4, 2, 3 would have 4 unique values.
Thanks.
Hey guys, does anyone know how to find the number of unique values in a 2 dimensional array.
For example: an array containing the numbers 1, 2, 3, 4, 4, 2, 3 would have 4 unique values.
Thanks.
or somethinCode:public int getUniqueValues(List<Integer> integers) {
List<Integer> alreadyUsed = new LinkedList<Integer>();
int unique = 0;
for (Integer i : integers) {
if (!alreadyUsed.contains(i)) {
alreadyUsed.add(i);
++unique;
}
}
return unique;
}
---------- Post added at 01:52 AM ---------- Previous post was at 01:43 AM ----------
shud workCode:>>> def getunique(integers):
... used = []
... unique = 0
... for i in integers:
... if used.count(i) == 0:
... used.append(i)
... unique=unique+1
... return unique
...
>>> getunique([1, 2, 3, 4, 4, 2, 3])
4
>>>
It might outprint 0 even if you didn't put it in the array, that's because when you initialize the array, all spots that aren't filled have values of 0Code:public void getUniqueValues(int[][] integers) {
ArrayList vals = new ArrayList();
for (int i = 0; i < integers.length; i++) {
for (int i2 = 0; i2 < integers[i].length; i2++) {
if (!vals.contains(integers[i][i2])) {
vals.add(integers[i][i2]);
System.out.println(integers[i][i2]);
}
}
}
}
Thanks for your help, but i figured it out already. I just converted it to a 1D array and found the uniques from there.
ewwww... learn to use genericsQuote:
Originally Posted by _Anthony [Only registered and activated users can see links. Click Here To Register...]