Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 3081e92

Browse files
committed
'修改完成'
1 parent ef55cdf commit 3081e92

14 files changed

+1348
-1466
lines changed

‎01_learn/02_栈(Stack)/01_栈的封装.html‎

Lines changed: 54 additions & 57 deletions
Original file line numberDiff line numberDiff line change
@@ -1,81 +1,78 @@
11
<!DOCTYPE html>
22
<html lang="en">
33
<head>
4-
<meta charset="UTF-8">
5-
<title>栈的封装</title>
4+
<meta charset="UTF-8">
5+
<title>栈的封装</title>
66
</head>
77
<body>
88
<script>
99

10-
//用数组封装栈类
11-
class Stack {
12-
//构造函数
13-
constructor() {
14-
//栈的属性
15-
this.items = [];
16-
}
17-
18-
//原型方法,栈的相关操作
19-
//1.让元素进入栈
20-
push(element) {
21-
this.items.push(element);
22-
}
23-
24-
//2.从栈中取出元素并返回
25-
pop() {
26-
return this.items.pop();
27-
}
10+
//用数组封装栈类
11+
class Stack {
12+
//构造函数
13+
constructor() {
14+
//栈的属性
15+
this.items = [];
16+
}
2817

29-
//3.查看栈最先出去的元素
30-
peak() {
31-
return this.items[this.items.length - 1];
32-
}
18+
//原型方法,栈的相关操作
19+
//1.让元素进入栈
20+
push(element) {
21+
this.items.push(element);
22+
}
3323

34-
//4.判断栈是否为空
35-
isEmpty() {
36-
return this.items.length===0;
37-
}
24+
//2.从栈中取出元素并返回
25+
pop() {
26+
return this.items.pop();
27+
}
3828

39-
//5.获取栈元素个数
40-
size() {
41-
return this.items.length;
42-
}
29+
//3.查看栈顶的元素(不对栈做任何修改)
30+
peak() {
31+
return this.items[this.items.length-1];
32+
}
4333

44-
//6.toString()方法
45-
toString() {
46-
//20 10 12 8 7
47-
let resultString = '';
48-
for (let i = 0; i < this.items.length; i++) {
49-
resultString += this.items[i] + ' '
50-
}
51-
return resultString;
52-
}
34+
//4.判断栈是否为空
35+
isEmpty() {
36+
return this.items.length === 0;
37+
}
5338

39+
//5.获取栈元素个数
40+
size() {
41+
return this.items.length;
5442
}
5543

56-
//测试栈
57-
let s = new Stack();
44+
//6.将栈结构的内容以字符串的形式返回
45+
toString() {
46+
let resultString = '';
47+
for (let item of this.items) {
48+
resultString += item + ' '
49+
}
50+
return resultString;
51+
}
52+
}
5853

59-
s.push(20);
60-
s.push(10);
61-
s.push(12);
62-
s.push(100);
63-
s.push(77);
64-
alert(s);
65-
alert(s.items);
54+
//测试栈
55+
let s = new Stack();
6656

67-
alert(s.pop());
68-
alert(s.pop());
69-
alert(s);
57+
s.push(20);
58+
s.push(10);
59+
s.push(12);
60+
s.push(100);
61+
s.push(77);
62+
alert(s);
63+
alert(s.items);
7064

71-
alert(s.peak());
65+
alert(s.pop());
66+
alert(s.pop());
67+
alert(s);
7268

73-
alert(s.isEmpty());
69+
alert(s.peak());
7470

75-
alert(s.size());
71+
alert(s.isEmpty());
7672

77-
alert(s.toString());
73+
alert(s.size());
7874

75+
alert(s.toString());
7976
</script>
8077

8178
</body>

‎01_learn/02_栈(Stack)/02_十进制转为二进制.html‎

Lines changed: 56 additions & 59 deletions
Original file line numberDiff line numberDiff line change
@@ -1,80 +1,77 @@
11
<!DOCTYPE html>
22
<html lang="en">
33
<head>
4-
<meta charset="UTF-8">
5-
<title>十进制转二进制</title>
4+
<meta charset="UTF-8">
5+
<title>十进制转二进制</title>
66
</head>
77
<body>
88
<div class="number" >
9-
<form class="change">
10-
<fieldset class="decTobin">
11-
<legend>Give a Dec to Bin.</legend>
12-
<input id="decTobin" type="text">
13-
</fieldset>
14-
</form>
9+
<form class="change">
10+
<fieldset class="decTobin">
11+
<legend>Give a Dec to Bin.</legend>
12+
<input id="decTobin" type="text">
13+
</fieldset>
14+
</form>
1515
</div>
1616

1717
<script>
1818

19-
class Stack {
20-
//构造函数
21-
constructor() {
22-
//栈的属性
23-
this.items = [];
24-
}
25-
//原型方法,栈的相关操作
26-
//1.将元素压入到栈
27-
push(element) {
28-
this.items.push(element);
29-
}
30-
31-
//2.从栈中取出元素
32-
pop() {
33-
return this.items.pop();
34-
}
35-
36-
//3.查看栈顶元素
37-
peak() {
38-
return this.items[this.items.length - 1];
39-
}
40-
41-
//4.判断栈是否为空
42-
isEmpty() {
43-
return this.items.length === 0;
44-
}
19+
class Stack {
20+
//构造函数
21+
constructor() {
22+
//栈的属性
23+
this.items = [];
24+
}
25+
//原型方法,栈的相关操作
26+
//1.将元素压入到栈
27+
push(element) {
28+
this.items.push(element);
29+
}
4530

46-
//5.获取栈元素个数
47-
size() {
48-
return this.items.length;
49-
}
31+
//2.从栈中取出元素
32+
pop() {
33+
return this.items.pop();
34+
}
5035

51-
//6.toString()方法
52-
toString() {
53-
//20 10 12 8 7
54-
let resultString = '';
55-
for (let i = 0; i < this.items.length; i++) {
56-
resultString += this.items[i] + ' '
57-
}
58-
return resultString;
59-
}
36+
//3.查看栈顶元素
37+
peak() {
38+
return this.items[this.items.length - 1];
39+
}
6040

41+
//4.判断栈是否为空
42+
isEmpty() {
43+
return this.items.length === 0;
6144
}
6245

63-
function decTobin(decNumber) {
64-
const stack = new Stack();
65-
while (decNumber > 0) {
66-
stack.push(decNumber % 2);
67-
decNumber = Math.floor(decNumber / 2);
68-
}
69-
let result = '';
70-
while (!stack.isEmpty()) {
71-
result += stack.pop()
72-
}
73-
return result;
46+
//5.获取栈元素个数
47+
size() {
48+
return this.items.length;
7449
}
7550

76-
alert(decTobin(100));
51+
//6.将栈结构的内容以字符串的形式返回
52+
toString() {
53+
let resultString = '';
54+
for (let item of this.items) {
55+
resultString += item + ' '
56+
}
57+
return resultString;
58+
}
59+
}
7760

61+
function decTobin(decNumber) {
62+
const stack = new Stack();
63+
while (decNumber > 0) {
64+
stack.push(decNumber % 2);
65+
decNumber = Math.floor(decNumber / 2);
66+
}
67+
let result = '';
68+
while (!stack.isEmpty()) {
69+
result += stack.pop()
70+
}
71+
return result;
72+
}
73+
74+
alert(decTobin(990));
7875
</script>
7976

8077
</body>

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /