xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 00:26:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Apply suggestions from code review

Browse source 
Co-authored-by: Justin Tse <xiefahit@gmail.com>
This commit is contained in:
Yudong Jin 2023-01-06 03:14:52 +08:00 committed by GitHub
parent 21096c8d0a
commit e96272a06f
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
2 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
codes/javascript/chapter_computational_complexity/worst_best_time_complexity.js
View file

@ -13,7 +13,7 @@ function randomNumbers(n) {
}
// 随机打乱数组元素
for (let i = 0; i < n; i++) {
let r = Math.floor(Math.random() * n);
let r = Math.floor(Math.random() * (i + 1));
let temp = nums[i];
nums[i] = nums[r];
nums[r] = temp;
@ -24,7 +24,7 @@ function randomNumbers(n) {
/* 查找数组 nums 中数字 1 所在索引 */
function findOne(nums) {
for (let i = 0; i < nums.length; i++) {
if (nums[i] == 1) {
if (nums[i] === 1) {
return i;
}
}

4
codes/typescript/chapter_computational_complexity/worst_best_time_complexity.ts
View file

@ -13,7 +13,7 @@ function randomNumbers(n: number): number[] {
}
// 随机打乱数组元素
for (let i = 0; i < n; i++) {
let r = Math.floor(Math.random() * n);
let r = Math.floor(Math.random() * (i + 1));
let temp = nums[i];
nums[i] = nums[r];
nums[r] = temp;
@ -24,7 +24,7 @@ function randomNumbers(n: number): number[] {
/* 查找数组 nums 中数字 1 所在索引 */
function findOne(nums: number[]): number {
for (let i = 0; i < nums.length; i++) {
if (nums[i] == 1) {
if (nums[i] === 1) {
return i;
}
}