mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-06 15:09:40 +08:00
Merge pull request #2832 from liaoming10/master
添加:0105.有向图的完全可达性Javascript代码
This commit is contained in:
@ -491,6 +491,54 @@ func main() {
|
||||
|
||||
### JavaScript
|
||||
|
||||
```javascript
|
||||
const rl = require('readline').createInterface({
|
||||
input:process.stdin,
|
||||
output:process.stdout
|
||||
})
|
||||
|
||||
let inputLines = []
|
||||
|
||||
rl.on('line' , (line)=>{
|
||||
inputLines.push(line)
|
||||
})
|
||||
|
||||
rl.on('close',()=>{
|
||||
let [n , edgesCount]= inputLines[0].trim().split(' ').map(Number)
|
||||
|
||||
let graph = Array.from({length:n+1} , ()=>{return[]})
|
||||
|
||||
for(let i = 1 ; i < inputLines.length ; i++ ){
|
||||
let [from , to] = inputLines[i].trim().split(' ').map(Number)
|
||||
graph[from].push(to)
|
||||
}
|
||||
|
||||
let visited = new Array(n + 1).fill(false)
|
||||
|
||||
let dfs = (graph , key , visited)=>{
|
||||
if(visited[key]){
|
||||
return
|
||||
}
|
||||
|
||||
visited[key] = true
|
||||
for(let nextKey of graph[key]){
|
||||
dfs(graph,nextKey , visited)
|
||||
}
|
||||
}
|
||||
|
||||
dfs(graph , 1 , visited)
|
||||
|
||||
for(let i = 1 ; i <= n;i++){
|
||||
if(visited[i] === false){
|
||||
console.log(-1)
|
||||
return
|
||||
}
|
||||
}
|
||||
console.log(1)
|
||||
|
||||
})
|
||||
```
|
||||
|
||||
### TypeScript
|
||||
|
||||
### PhP
|
||||
|
Reference in New Issue
Block a user