public Set<Integer> getAllFriendsAndPotentialFriends(int index, int deep) {
Set<Integer> set = new HashSet<>();
Set<Integer> resultSet = new HashSet<>();
for (int i = 0; i < humanRelationships.length; i++) {
if (i > index) {
if (humanRelationships[i][index]) resultSet.add(i);
} else {
if (humanRelationships[index][i] && index != i) resultSet.add(i);
}
}
for (int i = 1; i < deep; i++) {
resultSet.forEach(j -> {
for (int k = j; k < humanRelationships.length; k++) {
if (k != j && humanRelationships[k][j] && k != index) set.add(k);
}
});
resultSet.addAll(set);
}
return resultSet;
}
package com.javarush.task.task36.task3611;
import java.util.*;
import java.util.concurrent.CopyOnWriteArraySet;
/*
Сколько у человека потенциальных друзей?
*/
public class Solution {
private boolean[][] humanRelationships;
public static void main(String[] args) {
Solution solution = new Solution();
solution.humanRelationships = generateRelationships();
Set<Integer> allFriendsAndPotentialFriends = solution.getAllFriendsAndPotentialFriends(0, 2);
System.out.println(allFriendsAndPotentialFriends); // Expected: [0, 1, 2, 3, 5, 7]
Set<Integer> potentialFriends = solution.removeFriendsFromSet(allFriendsAndPotentialFriends, 4);
System.out.println(potentialFriends); // Expected: [2, 5, 7]
}
public Set<Integer> getAllFriendsAndPotentialFriends(int index, int deep) {
Set<Integer> set = new HashSet<>();
Set<Integer> resultSet = new HashSet<>();
for (int i = 0; i < humanRelationships.length; i++) {
if (i > index) {
if (humanRelationships[i][index]) resultSet.add(i);
} else {
if (humanRelationships[index][i] && index != i) resultSet.add(i);
}
}
for (int i = 1; i < deep; i++) {
resultSet.forEach(j -> {
for (int k = j; k < humanRelationships.length; k++) {
if (k != j && humanRelationships[k][j] && k != index) set.add(k);
}
});
resultSet.addAll(set);
set.clear();
}
return resultSet;
}
// Remove from the set the people with whom you already have a relationship
public Set<Integer> removeFriendsFromSet(Set<Integer> set, int index) {
for (int i = 0; i < humanRelationships.length; i++) {
if ((i < index) && (index < humanRelationships.length) && humanRelationships[index][i]) {
set.remove(i);
} else if ((i > index) && humanRelationships[i][index]) {
set.remove(i);
}
}
return set;
}
// Return test data
private static boolean[][] generateRelationships() {
return new boolean[][]{
// 0 1 2 3 4 5 6 7
{true}, //0
{true, true}, //1
{false, true, true}, //2
{false, false, false, true}, //3
{true, true, false, true, true}, //4
{true, false, true, false, false, true}, //5
{false, false, false, false, false, true, true}, //6
{false, false, false, true, false, false, false, true} //7
};
}
}