public interface InfluencerFinder { /** * Given a matrix of following between N LinkedIn users (with ids from 0 to N-1): * followingMatrix[i][j] == true iff user i is following user j * thus followingMatrix[i][j] doesn't imply followingMatrix[j][i]. * Let's also agree that followingMatrix[i][i] == false * * Influencer is a user who is: * - followed by everyone else and * - not following anyone himself * * This method should find an Influencer by a given matrix of following, * or return -1 if there is no Influencer in this group. */ int getInfluencer(boolean[][] followingMatrix)
和Find the celebrity 非常类似
int getInfluencer(vector<vector<bool> > M) { int candidate = 0; for(int i=1; i<M.size(); i++) { if(M[candidate][i] == true || M[i][candidate]==false) { candidate = i; } } // now verify candidate is indeed an influencer for(int j=0; j<M.size(); j++) { if(j==candidate) continue; if(M[candidate][j]==true || M[j][candidate]==false) return -1; } return candidate; }
转载于:https://www.cnblogs.com/hygeia/p/5154467.html
相关资源：影响者查找器：这是我为neuefische Web开发新手训练营的最终项目。 一款浏览影响者档案的应用程序，可以找到适合的应用程序-源码