forked from course-dasheng/fe-algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcount.js
29 lines (25 loc) · 848 Bytes
/
count.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
// const fs = require('fs')
// const path = require('path')
// const dir = path.resolve(__dirname,'./')
// let files = fs.readdirSync(dir)
// let len = files.filter(f=>/^\d+\..+\.js$/.test(f)).length
// console.log('一共刷了'+len+'题,加油!')
const fs = require('fs')
const path = require('path')
const dir = path.resolve(__dirname, './')
let ret = fs.readdirSync(dir)
let arr = ret.filter((v) => /^\d+\..+\.js$/.test(v))
let len = arr.length
console.log(`你刷了${len}个题`)
// console.log(len)
const md = fs.readFileSync(path.resolve(__dirname, './README.md'), 'utf8')
arr
.sort((a, b) => {
return Date(fs.statSync(a).ctime) - Date(fs.statSync(b).ctime)
})
.forEach((file) => {
let str = '* ' + file.split('.')[0] + '.'
if (md.indexOf(str) == -1) {
console.log(' * ' + file + ' 不存在')
}
})