Skip to content

Commit 508e2ed

Browse files
authored
Merge pull request #476 from ut-code/update-sample-scripts
Update sample scripts
2 parents ba08487 + 72bc9f7 commit 508e2ed

File tree

5 files changed

+13
-17
lines changed

5 files changed

+13
-17
lines changed
Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,17 @@
1-
const n = 89; //任意の整数
1+
const n = 89; // 任意の整数
22

33
let isPrime = true;
44
if (n <= 1) {
5+
// nが1以下のときは素数でない
56
isPrime = false;
67
}
78

89
for (let i = 2; i < n; i += 1) {
9-
// nが1以下のときは素数でない
1010
isPrime = isPrime && n % i != 0;
1111
}
1212

1313
if (isPrime) {
14-
document.write(`${n} は素数です`);
14+
document.write(`${n} は素数です`);
1515
} else {
16-
document.write(`${n} は素数ではありません`);
16+
document.write(`${n} は素数ではありません`);
1717
}

docs/1-trial-session/08-loop/_samples/is-prime/script.js

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -7,8 +7,8 @@ if (n <= 1) {
77
}
88

99
for (let i = 2; i < n; i += 1) {
10-
if (n % i == 0) {
11-
isPrime = false; // 変数には最後に代入した値のみを保持する
10+
if (n % i === 0) {
11+
isPrime = false;
1212
}
1313
}
1414

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,5 @@
11
let product = 1;
2-
3-
for (let i = 1; i <= 10; i += 1){
2+
for (let i = 1; i <= 10; i += 1) {
43
product *= i;
54
}
6-
75
document.write(product);
Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,5 @@
11
let product = 1;
2-
3-
for (i = 1; i <= 10; i = i + 1) {
2+
for (let i = 1; i <= 10; i = i + 1) {
43
product = product * i;
54
}
6-
75
document.write(product);

docs/1-trial-session/10-array/_samples/array-max/script.js

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,8 @@
1+
const array1 = [3, 6, 8, 5, 0];
2+
const array2 = [-8, -7, -3, -1, -5];
3+
const array3 = [5986, 7202, 9347, 3593, 8166, 662, 2235, 9323, 2240, 943];
4+
const array4 = [-878, -40, -324, -410, -592, -610, -880, -65, -423, -32];
5+
16
function findMaxNumber(numbers) {
27
if (numbers.length === 0) return; // 空配列を除外
38
let maxNumber = numbers[0];
@@ -9,11 +14,6 @@ function findMaxNumber(numbers) {
914
return maxNumber;
1015
}
1116

12-
const array1 = [3, 6, 8, 5, 0];
13-
const array2 = [-8, -7, -3, -1, -5];
14-
const array3 = [5986, 7202, 9347, 3593, 8166, 662, 2235, 9323, 2240, 943];
15-
const array4 = [-878, -40, -324, -410, -592, -610, -880, -65, -423, -32];
16-
1717
document.write(
1818
`<p>配列 [${array1}] の最大値は${findMaxNumber(array1)} です。</p>`,
1919
);

0 commit comments

Comments
 (0)