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

lint: added comments

Browse source
This commit is contained in:
RiverTwilight 2023-01-05 10:27:48 +08:00
parent c53f64d56b
commit 21096c8d0a
3 changed files with 16 additions and 0 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

@ -4,8 +4,10 @@
* Author: RiverTwilight (contact@rene.wang)
*/
/* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */
function randomNumbers(n) {
let nums = Array(n);
// 生成数组 nums = { 1, 2, 3, ..., n }
for (let i = 0; i < n; i++) {
nums[i] = i + 1;
}
@ -19,6 +21,7 @@ function randomNumbers(n) {
return nums;
}
/* 查找数组 nums 中数字 1 所在索引 */
function findOne(nums) {
for (let i = 0; i < nums.length; i++) {
if (nums[i] == 1) {
@ -28,6 +31,7 @@ function findOne(nums) {
return -1;
}
/* Driver Code */
function main() {
for (let i = 0; i < 10; i++) {
let n = 100;

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

@ -4,8 +4,10 @@
* Author: RiverTwilight (contact@rene.wang)
*/
/* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */
function randomNumbers(n: number): number[] {
let nums = Array(n);
// 生成数组 nums = { 1, 2, 3, ..., n }
for (let i = 0; i < n; i++) {
nums[i] = i + 1;
}
@ -19,6 +21,7 @@ function randomNumbers(n: number): number[] {
return nums;
}
/* 查找数组 nums 中数字 1 所在索引 */
function findOne(nums: number[]): number {
for (let i = 0; i < nums.length; i++) {
if (nums[i] == 1) {
@ -28,6 +31,7 @@ function findOne(nums: number[]): number {
return -1;
}
/* Driver Code */
function main(): void {
for (let i = 0; i < 10; i++) {
let n = 100;

8
docs/chapter_computational_complexity/time_complexity.md
View file

@ -2328,8 +2328,10 @@ $$
=== "JavaScript"
```js title="worst_best_time_complexity.js"
/* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */
function randomNumbers(n) {
let nums = Array(n);
// 生成数组 nums = { 1, 2, 3, ..., n }
for (let i = 0; i < n; i++) {
nums[i] = i + 1;
}
@ -2343,6 +2345,7 @@ $$
return nums;
}
/* 查找数组 nums 中数字 1 所在索引 */
function findOne(nums) {
for (let i = 0; i < nums.length; i++) {
if (nums[i] == 1) {
@ -2352,6 +2355,7 @@ $$
return -1;
}
/* Driver Code */
function main() {
for (let i = 0; i < 10; i++) {
let n = 100;
@ -2368,8 +2372,10 @@ $$
=== "TypeScript"
```typescript title="worst_best_time_complexity.ts"
/* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */
function randomNumbers(n: number): number[] {
let nums = Array(n);
// 生成数组 nums = { 1, 2, 3, ..., n }
for (let i = 0; i < n; i++) {
nums[i] = i + 1;
}
@ -2383,6 +2389,7 @@ $$
return nums;
}
/* 查找数组 nums 中数字 1 所在索引 */
function findOne(nums: number[]): number {
for (let i = 0; i < nums.length; i++) {
if (nums[i] == 1) {
@ -2392,6 +2399,7 @@ $$
return -1;
}
/* Driver Code */
function main(): void {
for (let i = 0; i < 10; i++) {
let n = 100;