Comments (6)
我添加english version吧?
from leetcode.
认领
from leetcode.
我添加english version吧?
好的啊,我分配给你们两个了
from leetcode.
/**
* @param {number[][]} M
* @return {number}
*
* 首先第一个肯定是一个圈子
* 然后依次遍历第二个人,第三个人
*
* 每遍历到一个人,都判断它和已经有的圈子的人是否是好友
* 如果它和多个圈子的人是好友,那么合并多个圈子
*
* 如果不是,那么它自己单独成为一个圈子
*/
var findCircleNum = function (M) {
var quan = [
[0]
];
for (var i = 1; i < M.length; i++) {
var belong = {};
for (var j = 0; j < quan.length; j++) {
for (var n = 0; n < quan[j].length; n++) {
var nowFriend = quan[j][n];
if (M[i][nowFriend] == 1 || M[nowFriend][i] == 1) {
belong[j] = 1;
break;
}
}
}
if (belong.length == 0) {
quan.push([i]);
} else {
var temp = [];
var newQuan = [];
quan.forEach((item, index) => {
if (!belong[index]) {
newQuan.push(item);
} else {
temp.push(...item);
}
})
temp.push(i);
newQuan.push(temp);
quan = newQuan;
}
}
return quan.length;
};
from leetcode.
/** * @param {number[][]} M * @return {number} * * 首先第一个肯定是一个圈子 * 然后依次遍历第二个人,第三个人 * * 每遍历到一个人,都判断它和已经有的圈子的人是否是好友 * 如果它和多个圈子的人是好友,那么合并多个圈子 * * 如果不是,那么它自己单独成为一个圈子 */ var findCircleNum = function (M) { var quan = [ [0] ]; for (var i = 1; i < M.length; i++) { var belong = {}; for (var j = 0; j < quan.length; j++) { for (var n = 0; n < quan[j].length; n++) { var nowFriend = quan[j][n]; if (M[i][nowFriend] == 1 || M[nowFriend][i] == 1) { belong[j] = 1; break; } } } if (belong.length == 0) { quan.push([i]); } else { var temp = []; var newQuan = []; quan.forEach((item, index) => { if (!belong[index]) { newQuan.push(item); } else { temp.push(...item); } }) temp.push(i); newQuan.push(temp); quan = newQuan; } } return quan.length; };
你的命名要笑死我啊
from leetcode.
英文版题解: https://github.com/azl397985856/leetcode/blob/master/problems/547.friend-circles-en.md
from leetcode.
Related Issues (20)
- 算法学习 HOT 1
- 树专题中双色标记法后序和前序写反了 HOT 2
- leetcode/thinkings/tree.md 出错 HOT 1
- some error
- 二分查找专题,寻找最左/右插入位置算法模板错误问题 HOT 9
- possible code error in thinkings/heap.md HOT 1
- link error HOT 4
- link is not correct
- [695.最大岛屿面积,360,面试原题]【每日一题】 HOT 3
- 【专题】 反向思考 HOT 3
- 【专题】 考虑每一项对结果到的贡献
- 【专题】递推方程时间复杂度优化
- 已发布文章的代码错误 HOT 7
- Remove duplicate CPP solution and add Python solution for problem 100.same-tree
- Add OSSF Scorecard security workflow
- 题目的排版可否改一改
- 关于二分法中查找中间点索引的算式 HOT 6
- leetcode-thinkings-tree.md BFS 模版调整 HOT 3
- anki-card 中只有10道题吗?截止到2023.11 HOT 1
- 【每日一题】- 2020-xx-xx - xxx
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from leetcode.