Вот мое решение
package com.test;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
public class DuplicateInMatrix {
public static void main(String[] args) {
Integer[][] arr = { { 1, 2, 3 }, { 4, 5, 6 }, { 1, 2, 3 } };
Set<Element> set = new HashSet<>();
for (int i = 0; i < arr.length; i++) {
set.add(new Element(arr.length, arr[i]));
}
buildResultArray(set);
}
private static void buildResultArray(Set<Element> set) {
Integer[][] arr = new Integer[set.size()][];
Iterator<Element> itr = set.iterator();
for (int i = 0; i < arr.length && itr.hasNext(); i++) {
arr[i] = itr.next().row;
}
printArrray(arr);
}
private static void printArrray(Integer[][] arr) {
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
static class Element {
int n;
Integer[] row = new Integer[n];
public Element(int n, Integer[] row) {
this.n = n;
this.row = row;
}
@Override
public int hashCode() {
return Arrays.hashCode(row);
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Element other = (Element) obj;
return Arrays.deepEquals(this.row, other.row);
}
@Override
public String toString() {
return Arrays.toString(row);
}
}
}