diff --git "a/\346\235\216\346\254\247\351\233\257/2.28-\346\226\207\344\273\266\347\232\204\350\257\273\345\217\226/readfile.js" "b/\346\235\216\346\254\247\351\233\257/2.28-\346\226\207\344\273\266\347\232\204\350\257\273\345\217\226/readfile.js" index 640461209b3b6d72c90be70aae1d8085e8cf66ee..c4bf4f0eff6e6e13a10ad38c1fc987ad66be9b42 100644 --- "a/\346\235\216\346\254\247\351\233\257/2.28-\346\226\207\344\273\266\347\232\204\350\257\273\345\217\226/readfile.js" +++ "b/\346\235\216\346\254\247\351\233\257/2.28-\346\226\207\344\273\266\347\232\204\350\257\273\345\217\226/readfile.js" @@ -2,20 +2,44 @@ //引入模块 let fs = require("fs"); let str = ""; +let max = 0; +let min; function filenum(num) { if (!isNaN(num) && num > 0) { - for (let i = 1; i <= num; i++) { - let path = `${__dirname}/${i}.txt`; - let fd = fs.openSync(path, 'w'); + let arr = []; + let temp; + for (let i = 0; i < num; i++) { let rd = Math.floor(Math.random() * 100); - fs.writeSync(fd, rd); + arr[i] = rd; + } console.log("原数组:" + arr); + for (let i = 0; i < arr.length; i++) { + for (let j = 0; j < arr.length - 1; j++) { + //从小到大 + if (arr[j] > arr[j + 1]) { + temp = arr[j + 1]; + arr[j + 1] = arr[j]; + arr[j] = temp; + } + } + } console.log("排序后:" + arr); + for (let i = 0; i < num; i++) { + let path = `${__dirname}/${i + 1}.txt`; + let fd = fs.openSync(path, 'w'); + fs.writeSync(fd, arr[i]); //读取文件内容 let read = fs.readFileSync(path); str += read; fs.closeSync(fd); + if (min >= arr[i] || min === undefined) { + min = arr[i]; + } else if (max <= arr[i] && max !== undefined) { + max = arr[i]; + } } - console.log(str); - }else{ + console.log("拼接:" + str); + console.log("最大值:" + max); + console.log("最小值:" + min); + } else { console.log("请重新输入"); } -}filenum(5) +} filenum(5)