-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrss.xml
More file actions
2261 lines (1851 loc) · 146 KB
/
Copy pathrss.xml
File metadata and controls
2261 lines (1851 loc) · 146 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>cdk's blog</title><link>https://dkcdsj.github.io/</link><description>Recent content on cdk's blog</description><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Sat, 13 Dec 2025 23:41:21 +0800</lastBuildDate><atom:link href="https://dkcdsj.github.io/rss.xml" rel="self" type="application/rss+xml"/><item><title>常用学习资源汇总</title><link>https://dkcdsj.github.io/post/page/</link><pubDate>Mon, 13 Oct 2025 00:30:33 +0800</pubDate><guid>https://dkcdsj.github.io/post/page/</guid><description><h1 id="pdf资源下载">PDF资源下载
<a class="header-anchor" href="#pdf%e8%b5%84%e6%ba%90%e4%b8%8b%e8%bd%bd"></a>
</h1><ol>
<li>
<p><a href="https://zlib.wwwnav.com/">zlib中转</a></p>
</li>
<li>
<p><a href="https://libgen.li/">Library Genesis</a></p>
</li>
</ol>
<h1 id="feec学习资料">FEEC学习资料
<a class="header-anchor" href="#feec%e5%ad%a6%e4%b9%a0%e8%b5%84%e6%96%99"></a>
</h1><ol>
<li><a href="https://www-users.cse.umn.edu/~arnold/">Douglas N. Arnold主页</a></li>
<li><a href="https://space.bilibili.com/382917835?spm_id_from=333.1007.0.0">2012年FEEC十讲</a></li>
<li><a href="https://www.bilibili.com/video/BV1Dm411Q77k/?spm_id_from=333.1007.top_right_bar_window_history.content.click&amp;vd_source=ba162adb66c8638bee4c94f5c67beda6">2019年FEEC四讲+总结</a></li>
<li><a href="https://icerm.brown.edu/video_archive?search=FEEC&amp;page=1#/play/526">2020年FEEC与广义相对论四讲</a></li>
</ol>
<h1 id="c学习资料">C++学习资料
<a class="header-anchor" href="#c%e5%ad%a6%e4%b9%a0%e8%b5%84%e6%96%99"></a>
</h1><ol>
<li>
<p><a href="https://web.stanford.edu/class/archive/cs/cs106b/cs106b.1224/">106B22冬作业</a></p>
</li>
<li>
<p><a href="https://web.stanford.edu/class/archive/cs/cs106b/cs106b.1242/lectures/">106B23秋笔记</a></p>
</li>
<li>
<p><a href="https://www.zhihu.com/column/c_1471256108476461057">22冬作业辅导</a></p>
</li>
<li>
<p><a href="https://github.com/Andy-xiaokang/CS106B/tree/master">106B作业启动库</a></p>
</li>
</ol></description></item><item><title>Linux基础命令</title><link>https://dkcdsj.github.io/computernotes/linux%E5%9F%BA%E7%A1%80%E5%91%BD%E4%BB%A4/</link><pubDate>Sat, 13 Dec 2025 23:41:21 +0800</pubDate><guid>https://dkcdsj.github.io/computernotes/linux%E5%9F%BA%E7%A1%80%E5%91%BD%E4%BB%A4/</guid><description><h1 id="linux基础命令">Linux基础命令
<a class="header-anchor" href="#linux%e5%9f%ba%e7%a1%80%e5%91%bd%e4%bb%a4"></a>
</h1><h2 id="文件目录操作">文件目录操作
<a class="header-anchor" href="#%e6%96%87%e4%bb%b6%e7%9b%ae%e5%bd%95%e6%93%8d%e4%bd%9c"></a>
</h2><h3 id="ls-列出命令">ls 列出命令
<a class="header-anchor" href="#ls-%e5%88%97%e5%87%ba%e5%91%bd%e4%bb%a4"></a>
</h3>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1">1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2">2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3">3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4">4</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-shell" data-lang="shell"><span class="line"><span class="cl"><span class="c1"># list 列出当前目录下所有的文件</span>
</span></span><span class="line"><span class="cl">ls
</span></span><span class="line"><span class="cl"><span class="c1"># 列出每个文件的属性 </span>
</span></span><span class="line"><span class="cl">ls -l</span></span></code></pre></td></tr></table>
</div>
</div>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-1-1"><a class="lnlinks" href="#hl-1-1">1</a>
</span><span class="lnt" id="hl-1-2"><a class="lnlinks" href="#hl-1-2">2</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">-rw-r--r-- 1 xxx xxx 5795 Dec 13 23:53 README.md
</span></span><span class="line"><span class="cl">drwxr-xr-x 2 xxx xxx 4096 Dec 13 23:53 appendix-optimization</span></span></code></pre></td></tr></table>
</div>
</div>
<ol>
<li>
<p>第一列是权限相关: 第一个字母是d表示目录-表示普通文件之后是权限rwx(Read Write eXecute)</p>
</li>
<li>
<p>第一组是所有者权限 第二组是同一个group下用户的权限 第三组是group外成员的权限</p>
</li>
<li>
<p>第三列是所有者 第四列是group名 第五列是文件大小 之后是修改时间</p>
</li>
</ol>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-2-1"><a class="lnlinks" href="#hl-2-1">1</a>
</span><span class="lnt" id="hl-2-2"><a class="lnlinks" href="#hl-2-2">2</a>
</span><span class="lnt" id="hl-2-3"><a class="lnlinks" href="#hl-2-3">3</a>
</span><span class="lnt" id="hl-2-4"><a class="lnlinks" href="#hl-2-4">4</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-shell" data-lang="shell"><span class="line"><span class="cl"><span class="c1"># 显示目录下的隐藏文件</span>
</span></span><span class="line"><span class="cl">ls -a
</span></span><span class="line"><span class="cl"><span class="c1"># 列出文件属性包含隐藏文件</span>
</span></span><span class="line"><span class="cl">ls -la</span></span></code></pre></td></tr></table>
</div>
</div>
<blockquote>
<p>一般终端中都定义ll命令, 相当于是ls -l</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-3-1"><a class="lnlinks" href="#hl-3-1">1</a>
</span><span class="lnt" id="hl-3-2"><a class="lnlinks" href="#hl-3-2">2</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-shell" data-lang="shell"><span class="line"><span class="cl"><span class="c1"># ls -l 的缩写</span>
</span></span><span class="line"><span class="cl">ll</span></span></code></pre></td></tr></table>
</div>
</div>
</blockquote>
<h3 id="cd-进入目录命令">cd 进入目录命令
<a class="header-anchor" href="#cd-%e8%bf%9b%e5%85%a5%e7%9b%ae%e5%bd%95%e5%91%bd%e4%bb%a4"></a>
</h3>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-4-1"><a class="lnlinks" href="#hl-4-1"> 1</a>
</span><span class="lnt" id="hl-4-2"><a class="lnlinks" href="#hl-4-2"> 2</a>
</span><span class="lnt" id="hl-4-3"><a class="lnlinks" href="#hl-4-3"> 3</a>
</span><span class="lnt" id="hl-4-4"><a class="lnlinks" href="#hl-4-4"> 4</a>
</span><span class="lnt" id="hl-4-5"><a class="lnlinks" href="#hl-4-5"> 5</a>
</span><span class="lnt" id="hl-4-6"><a class="lnlinks" href="#hl-4-6"> 6</a>
</span><span class="lnt" id="hl-4-7"><a class="lnlinks" href="#hl-4-7"> 7</a>
</span><span class="lnt" id="hl-4-8"><a class="lnlinks" href="#hl-4-8"> 8</a>
</span><span class="lnt" id="hl-4-9"><a class="lnlinks" href="#hl-4-9"> 9</a>
</span><span class="lnt" id="hl-4-10"><a class="lnlinks" href="#hl-4-10">10</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl"># 进入目录
</span></span><span class="line"><span class="cl">cd dictionary_name
</span></span><span class="line"><span class="cl"># 进入上一层目录
</span></span><span class="line"><span class="cl">cd ..
</span></span><span class="line"><span class="cl"># 进入当前目录
</span></span><span class="line"><span class="cl">cd .
</span></span><span class="line"><span class="cl"># 进入上上层目录
</span></span><span class="line"><span class="cl">cd ../..
</span></span><span class="line"><span class="cl"># 回到刚刚的目录
</span></span><span class="line"><span class="cl">cd -</span></span></code></pre></td></tr></table>
</div>
</div>
<h3 id="pwd-print-working-directory命令">pwd Print working directory命令
<a class="header-anchor" href="#pwd-print-working-directory%e5%91%bd%e4%bb%a4"></a>
</h3><p>打印当前所在目录的完整路径</p>
<h2 id="文本文件的编辑阅读">文本文件的编辑阅读
<a class="header-anchor" href="#%e6%96%87%e6%9c%ac%e6%96%87%e4%bb%b6%e7%9a%84%e7%bc%96%e8%be%91%e9%98%85%e8%af%bb"></a>
</h2><h2 id="文件属性">文件属性
<a class="header-anchor" href="#%e6%96%87%e4%bb%b6%e5%b1%9e%e6%80%a7"></a>
</h2><h2 id="打印">打印
<a class="header-anchor" href="#%e6%89%93%e5%8d%b0"></a>
</h2><h2 id="shell脚本初步">Shell脚本初步
<a class="header-anchor" href="#shell%e8%84%9a%e6%9c%ac%e5%88%9d%e6%ad%a5"></a>
</h2></description></item><item><title>Pde数值解第六章连续内罚有限元</title><link>https://dkcdsj.github.io/fem/pde%E6%95%B0%E5%80%BC%E8%A7%A3%E7%AC%AC%E5%85%AD%E7%AB%A0%E8%BF%9E%E7%BB%AD%E5%86%85%E7%BD%9A%E6%9C%89%E9%99%90%E5%85%83/</link><pubDate>Wed, 12 Nov 2025 23:44:51 +0800</pubDate><guid>https://dkcdsj.github.io/fem/pde%E6%95%B0%E5%80%BC%E8%A7%A3%E7%AC%AC%E5%85%AD%E7%AB%A0%E8%BF%9E%E7%BB%AD%E5%86%85%E7%BD%9A%E6%9C%89%E9%99%90%E5%85%83/</guid><description><script type="text/javascript" src= '/js/pdf-js/build/pdf.js'></script>
<style>
#embed-pdf-container {
position: relative;
width: 100%;
height: auto;
min-height: 20vh;
}
.pdf-canvas {
border: 1px solid black;
direction: ltr;
width: 100%;
height: auto;
display: none;
}
#the-canvas {
border: 1px solid black;
direction: ltr;
width: 100%;
height: auto;
display: none;
}
.pdf-loadingWrapper {
display: none;
justify-content: center;
align-items: center;
width: 100%;
height: 350px;
}
.pdf-loading {
display: inline-block;
width: 50px;
height: 50px;
border: 3px solid #d2d0d0;;
border-radius: 50%;
border-top-color: #383838;
animation: spin 1s ease-in-out infinite;
-webkit-animation: spin 1s ease-in-out infinite;
}
.pdf-paginator {
text-align:center;
}
#overlayText {
word-wrap: break-word;
display: none;
justify-content: end;
}
#overlayText a {
position: relative;
top: 10px;
right: 4px;
color: #000;
margin: auto;
background-color: #eeeeee;
padding: 0.3em 1em;
border: solid 2px;
border-radius: 12px;
border-color: #00000030;
text-decoration: none;
}
#overlayText svg {
height: clamp(1em, 2vw, 1.4em);
width: clamp(1em, 2vw, 1.4em);
}
@keyframes spin {
to { -webkit-transform: rotate(360deg); }
}
@-webkit-keyframes spin {
to { -webkit-transform: rotate(360deg); }
}
</style><div class="embed-pdf-container" id="embed-pdf-container-7097921e">
<div class="pdf-loadingWrapper" id="pdf-loadingWrapper-7097921e">
<div class="pdf-loading" id="pdf-loading-7097921e"></div>
</div>
<div id="overlayText">
<a href="../../fem/pde%e6%95%b0%e5%80%bc%e8%a7%a3%e7%ac%ac%e5%85%ad%e7%ab%a0%e8%bf%9e%e7%bb%ad%e5%86%85%e7%bd%9a%e6%9c%89%e9%99%90%e5%85%83/nmpde6.pdf" aria-label="Download" download>
<svg aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 18 18">
<path d="M9 13c.3 0 .5-.1.7-.3L15.4 7 14 5.6l-4 4V1H8v8.6l-4-4L2.6 7l5.7 5.7c.2.2.4.3.7.3zm-7 2h14v2H2z" />
</svg>
</a>
</div>
<canvas class="pdf-canvas" id="pdf-canvas-7097921e"></canvas>
</div>
<div class="pdf-paginator" id="pdf-paginator-7097921e">
<button id="pdf-prev-7097921e">Previous</button>
<button id="pdf-next-7097921e">Next</button> &nbsp; &nbsp;
<span>
<span class="pdf-pagenum" id="pdf-pagenum-7097921e"></span> / <span class="pdf-pagecount" id="pdf-pagecount-7097921e"></span>
</span>
<a class="pdf-source" id="pdf-source-7097921e" href="../../fem/pde%e6%95%b0%e5%80%bc%e8%a7%a3%e7%ac%ac%e5%85%ad%e7%ab%a0%e8%bf%9e%e7%bb%ad%e5%86%85%e7%bd%9a%e6%9c%89%e9%99%90%e5%85%83/nmpde6.pdf">[pdf]</a>
</div>
<noscript>
View the PDF file <a class="pdf-source" id="pdf-source-noscript-7097921e" href="../../fem/pde%e6%95%b0%e5%80%bc%e8%a7%a3%e7%ac%ac%e5%85%ad%e7%ab%a0%e8%bf%9e%e7%bb%ad%e5%86%85%e7%bd%9a%e6%9c%89%e9%99%90%e5%85%83/nmpde6.pdf">here</a>.
</noscript>
<script type="text/javascript">
(function(){
var url = '..\/..\/fem\/pde数值解第六章连续内罚有限元\/nmpde6.pdf';
var hidePaginator = "true" === "true";
var hideLoader = "" === "true";
var selectedPageNum = parseInt("") || 1;
var showSource = "" === "true";
var pageSource = document.getElementById("pdf-source-7097921e");
function showSourcef() {
if(showSource) {
pageSource.style.display = 'inline';
} else {
pageSource.style.display = 'none';
}
}
showSourcef();
var pdfjsLib = window['pdfjs-dist/build/pdf'];
if (pdfjsLib.GlobalWorkerOptions.workerSrc == '')
pdfjsLib.GlobalWorkerOptions.workerSrc = "https:\/\/dkcdsj.github.io\/" + 'js/pdf-js/build/pdf.worker.js';
var pdfDoc = null,
pageNum = selectedPageNum,
pageRendering = false,
pageNumPending = null,
scale = 3,
canvas = document.getElementById('pdf-canvas-7097921e'),
ctx = canvas.getContext('2d'),
paginator = document.getElementById("pdf-paginator-7097921e"),
loadingWrapper = document.getElementById('pdf-loadingWrapper-7097921e');
showPaginator();
showLoader();
function renderPage(num) {
pageRendering = true;
pdfDoc.getPage(num).then(function(page) {
var viewport = page.getViewport({scale: scale});
canvas.height = viewport.height;
canvas.width = viewport.width;
var renderContext = {
canvasContext: ctx,
viewport: viewport
};
var renderTask = page.render(renderContext);
renderTask.promise.then(function() {
pageRendering = false;
showContent();
if (pageNumPending !== null) {
renderPage(pageNumPending);
pageNumPending = null;
}
});
});
document.getElementById('pdf-pagenum-7097921e').textContent = num;
}
function showContent() {
loadingWrapper.style.display = 'none';
canvas.style.display = 'block';
}
function showLoader() {
if(hideLoader) return
loadingWrapper.style.display = 'flex';
canvas.style.display = 'none';
}
function showPaginator() {
if(hidePaginator) return
paginator.style.display = 'block';
}
function queueRenderPage(num) {
if (pageRendering) {
pageNumPending = num;
} else {
renderPage(num);
}
}
function onPrevPage() {
if (pageNum <= 1) {
return;
}
pageNum--;
queueRenderPage(pageNum);
}
document.getElementById('pdf-prev-7097921e').addEventListener('click', onPrevPage);
function onNextPage() {
if (pageNum >= pdfDoc.numPages) {
return;
}
pageNum++;
queueRenderPage(pageNum);
}
document.getElementById('pdf-next-7097921e').addEventListener('click', onNextPage);
pdfjsLib.getDocument(url).promise.then(function(pdfDoc_) {
pdfDoc = pdfDoc_;
var numPages = pdfDoc.numPages;
document.getElementById('pdf-pagecount-7097921e').textContent = numPages;
if(pageNum > numPages) {
pageNum = numPages
}
renderPage(pageNum);
});
})();
</script></description></item><item><title>Mathematica第一讲</title><link>https://dkcdsj.github.io/%E7%AC%A6%E5%8F%B7%E8%AE%A1%E7%AE%97/mathematica%E7%AC%AC%E4%B8%80%E8%AE%B2/</link><pubDate>Wed, 12 Nov 2025 23:26:53 +0800</pubDate><guid>https://dkcdsj.github.io/%E7%AC%A6%E5%8F%B7%E8%AE%A1%E7%AE%97/mathematica%E7%AC%AC%E4%B8%80%E8%AE%B2/</guid><description><h1 id="mathematica及其应用">Mathematica及其应用
<a class="header-anchor" href="#mathematica%e5%8f%8a%e5%85%b6%e5%ba%94%e7%94%a8"></a>
</h1><h2 id="lec1-1">Lec1-1
<a class="header-anchor" href="#lec1-1"></a>
</h2><h3 id="其他数学软件">其他数学软件
<a class="header-anchor" href="#%e5%85%b6%e4%bb%96%e6%95%b0%e5%ad%a6%e8%bd%af%e4%bb%b6"></a>
</h3><ol>
<li>
<p>Matlab</p>
<p>矩阵实验室, 关注矩阵运算 数值计算</p>
</li>
<li>
<p>Mathematica</p>
<p>符号计算 语言适合数学研究 贴近数学</p>
</li>
<li>
<p>Maple</p>
<p>符号计算 版本之间可能缺少兼容性 语言设计存在问题 贴近C语言 不具有友好性</p>
<p>优点工具包比较多</p>
</li>
<li>
<p>其他数学 略</p>
</li>
</ol>
<h3 id="欧拉计划">欧拉计划
<a class="header-anchor" href="#%e6%ac%a7%e6%8b%89%e8%ae%a1%e5%88%92"></a>
</h3><p>网址: <a href="https://pe-cn.github.io/">https://pe-cn.github.io/</a></p>
<p><img src="https://dkcdsj.github.io/%E7%AC%A6%E5%8F%B7%E8%AE%A1%E7%AE%97/mathematica%E7%AC%AC%E4%B8%80%E8%AE%B2/20251113000949371.png" alt="20251113000949371" loading="lazy"></p>
<h3 id="参考书">参考书
<a class="header-anchor" href="#%e5%8f%82%e8%80%83%e4%b9%a6"></a>
</h3><ol>
<li>Mathematica 文档</li>
<li>Essentials Of Programming In Mathematica</li>
<li>Mathematica programming: an advanced introduction</li>
<li>Mathematica Cookbook 例子</li>
</ol>
<h3 id="mathematica帮助系统">Mathematica帮助系统
<a class="header-anchor" href="#mathematica%e5%b8%ae%e5%8a%a9%e7%b3%bb%e7%bb%9f"></a>
</h3><p><img src="https://dkcdsj.github.io/%E7%AC%A6%E5%8F%B7%E8%AE%A1%E7%AE%97/mathematica%E7%AC%AC%E4%B8%80%E8%AE%B2/image-20251113231553957.png" alt="image-20251113231553957" loading="lazy"></p>
<ol>
<li>主讲第一部分核心语言与结构(到字符串处理)</li>
</ol>
<h2 id="lec1-2">Lec1-2
<a class="header-anchor" href="#lec1-2"></a>
</h2><ol>
<li>只介绍Mathematica的核心语言</li>
<li>从 2+2=4 开始,讲到如何定义 Mathematica 中没有的运算</li>
<li>不关注数据结构、算法和计算复杂度等内容</li>
</ol>
<h3 id="">
<a class="header-anchor" href="#"></a>
</h3></description></item><item><title>106Blec5Stacks and Queues</title><link>https://dkcdsj.github.io/cpp/106blec5stacks-and-queues/</link><pubDate>Sat, 08 Nov 2025 10:39:31 +0800</pubDate><guid>https://dkcdsj.github.io/cpp/106blec5stacks-and-queues/</guid><description><h1 id="栈和队列">栈和队列
<a class="header-anchor" href="#%e6%a0%88%e5%92%8c%e9%98%9f%e5%88%97"></a>
</h1><h2 id="stack-overview-堆栈概述">Stack Overview 堆栈概述
<a class="header-anchor" href="#stack-overview-%e5%a0%86%e6%a0%88%e6%a6%82%e8%bf%b0"></a>
</h2><ol>
<li>The first ADT we saw today was the stack. A stack is a <strong>LIFO</strong> (last-in, first-out) data structure. It generally supports a limited set of operations:
我们今天看到的第一个抽象数据类型是栈。栈是一种后进先出( <strong>LIFO</strong> )数据结构。它通常只支持有限的操作:</li>
</ol>
<table>
<thead>
<tr>
<th>Member Function 成员函数</th>
<th>Description 描述</th>
</tr>
</thead>
<tbody>
<tr>
<td>clear()</td>
<td>removes all elements from the stack 从栈中移除所有元素</td>
</tr>
<tr>
<td>equals(stack)</td>
<td>returns true if the two stacks contain the same elements in the same order, false otherwise 如果两个栈包含相同顺序的相同元素,则返回 true,否则返回 false</td>
</tr>
<tr>
<td>isEmpty()</td>
<td>returns true if the stack contains no elements, false otherwise 如果栈不包含任何元素,则返回 true,否则返回 false</td>
</tr>
<tr>
<td>peek()</td>
<td>returns the element on the top of the stack without removing it 返回栈顶元素但不移除它</td>
</tr>
<tr>
<td>pop()</td>
<td>removes the element from the top of the stack and returns it 从栈顶移除元素并返回它</td>
</tr>
<tr>
<td>push(value)</td>
<td>pushes value onto the stack 将值压入栈中</td>
</tr>
<tr>
<td>size()</td>
<td>returns the number of values in the stack 返回栈中的元素数量</td>
</tr>
<tr>
<td>. . .</td>
<td>For an exhaustive list, see: <a href="https://web.stanford.edu/dept/cs_edu/resources/cslib_docs/Stack.html">Stanford Stack class</a> 如需完整列表,请参阅:斯坦福栈类</td>
</tr>
</tbody>
</table>
<h2 id="queue-overview--队列概述">Queue Overview 队列概述
<a class="header-anchor" href="#queue-overview--%e9%98%9f%e5%88%97%e6%a6%82%e8%bf%b0"></a>
</h2><ol>
<li>We then discussed the queue ADT. A queue is a <strong>FIFO</strong> (first-in, first-out) data structure. Like the stack, it generally supports a limited set of operations:
我们接着讨论了队列抽象数据类型。队列是一种先进先出(FIFO)的数据结构。和栈一样,它通常支持一组有限的操作:</li>
</ol>
<table>
<thead>
<tr>
<th>Member Function 成员函数</th>
<th>Description 描述</th>
</tr>
</thead>
<tbody>
<tr>
<td>clear()</td>
<td>removes all elements from the queue 从队列中移除所有元素</td>
</tr>
<tr>
<td>dequeue()</td>
<td>removes and returns the frontmost element in the queue 移除并返回队列中最前面的元素</td>
</tr>
<tr>
<td>enqueue(value)</td>
<td>adds value to the back of the queue 将 value 添加到队列的末尾</td>
</tr>
<tr>
<td>equals()</td>
<td>returns true if the two queues contain the same elements in the same order, false otherwise 如果两个队列包含相同顺序的相同元素,则返回 true,否则返回 false</td>
</tr>
<tr>
<td>isEmpty()</td>
<td>returns <em>true</em> if the queue contains no elements, false otherwise 如果队列不包含任何元素,则返回 true,否则返回 false</td>
</tr>
<tr>
<td>peek()</td>
<td>returns the frontmost element in the queue without removing it 返回队列中最前面的元素,但不移除它</td>
</tr>
<tr>
<td>size()</td>
<td>returns the number of values in the queue 返回队列中的值数量</td>
</tr>
<tr>
<td>. . .</td>
<td>For an exhaustive list, see: <a href="https://web.stanford.edu/dept/cs_edu/resources/cslib_docs/Queue.html">Stanford Queue class</a> 如需完整列表,请参阅:斯坦福队列类</td>
</tr>
</tbody>
</table></description></item><item><title>106BLec4作业有感</title><link>https://dkcdsj.github.io/cpp/106blec4%E4%BD%9C%E4%B8%9A%E6%9C%89%E6%84%9F/</link><pubDate>Fri, 07 Nov 2025 15:58:44 +0800</pubDate><guid>https://dkcdsj.github.io/cpp/106blec4%E4%BD%9C%E4%B8%9A%E6%9C%89%E6%84%9F/</guid><description><h2 id="作业1">作业1
<a class="header-anchor" href="#%e4%bd%9c%e4%b8%9a1"></a>
</h2>
<blockquote>
<p>We wrote various tests for the extractAlpha() function in class today. Add to that code a separate STUDENT_TEST that contains a suite of test cases for the passwordChecksOut() function. What sorts of things would you test to ensure you have robust testing coverage for that function?</p>
<p>我们今天在课堂上为 extractAlpha() 函数编写了各种测试。在该代码中添加一个单独的 STUDENT_TEST,其中包含一套 passwordChecksOut() 函数的测试用例。您将测试哪些内容来确保该函数具有强大的测试覆盖率?</p>
</blockquote>
<p>主要是为了给 passwordChecksOut() 函数编写测试用例没有难度</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1"> 1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2"> 2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3"> 3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4"> 4</a>
</span><span class="lnt" id="hl-0-5"><a class="lnlinks" href="#hl-0-5"> 5</a>
</span><span class="lnt" id="hl-0-6"><a class="lnlinks" href="#hl-0-6"> 6</a>
</span><span class="lnt" id="hl-0-7"><a class="lnlinks" href="#hl-0-7"> 7</a>
</span><span class="lnt" id="hl-0-8"><a class="lnlinks" href="#hl-0-8"> 8</a>
</span><span class="lnt" id="hl-0-9"><a class="lnlinks" href="#hl-0-9"> 9</a>
</span><span class="lnt" id="hl-0-10"><a class="lnlinks" href="#hl-0-10">10</a>
</span><span class="lnt" id="hl-0-11"><a class="lnlinks" href="#hl-0-11">11</a>
</span><span class="lnt" id="hl-0-12"><a class="lnlinks" href="#hl-0-12">12</a>
</span><span class="lnt" id="hl-0-13"><a class="lnlinks" href="#hl-0-13">13</a>
</span><span class="lnt" id="hl-0-14"><a class="lnlinks" href="#hl-0-14">14</a>
</span><span class="lnt" id="hl-0-15"><a class="lnlinks" href="#hl-0-15">15</a>
</span><span class="lnt" id="hl-0-16"><a class="lnlinks" href="#hl-0-16">16</a>
</span><span class="lnt" id="hl-0-17"><a class="lnlinks" href="#hl-0-17">17</a>
</span><span class="lnt" id="hl-0-18"><a class="lnlinks" href="#hl-0-18">18</a>
</span><span class="lnt" id="hl-0-19"><a class="lnlinks" href="#hl-0-19">19</a>
</span><span class="lnt" id="hl-0-20"><a class="lnlinks" href="#hl-0-20">20</a>
</span><span class="lnt" id="hl-0-21"><a class="lnlinks" href="#hl-0-21">21</a>
</span><span class="lnt" id="hl-0-22"><a class="lnlinks" href="#hl-0-22">22</a>
</span><span class="lnt" id="hl-0-23"><a class="lnlinks" href="#hl-0-23">23</a>
</span><span class="lnt" id="hl-0-24"><a class="lnlinks" href="#hl-0-24">24</a>
</span><span class="lnt" id="hl-0-25"><a class="lnlinks" href="#hl-0-25">25</a>
</span><span class="lnt" id="hl-0-26"><a class="lnlinks" href="#hl-0-26">26</a>
</span><span class="lnt" id="hl-0-27"><a class="lnlinks" href="#hl-0-27">27</a>
</span><span class="lnt" id="hl-0-28"><a class="lnlinks" href="#hl-0-28">28</a>
</span><span class="lnt" id="hl-0-29"><a class="lnlinks" href="#hl-0-29">29</a>
</span><span class="lnt" id="hl-0-30"><a class="lnlinks" href="#hl-0-30">30</a>
</span><span class="lnt" id="hl-0-31"><a class="lnlinks" href="#hl-0-31">31</a>
</span><span class="lnt" id="hl-0-32"><a class="lnlinks" href="#hl-0-32">32</a>
</span><span class="lnt" id="hl-0-33"><a class="lnlinks" href="#hl-0-33">33</a>
</span><span class="lnt" id="hl-0-34"><a class="lnlinks" href="#hl-0-34">34</a>
</span><span class="lnt" id="hl-0-35"><a class="lnlinks" href="#hl-0-35">35</a>
</span><span class="lnt" id="hl-0-36"><a class="lnlinks" href="#hl-0-36">36</a>
</span><span class="lnt" id="hl-0-37"><a class="lnlinks" href="#hl-0-37">37</a>
</span><span class="lnt" id="hl-0-38"><a class="lnlinks" href="#hl-0-38">38</a>
</span><span class="lnt" id="hl-0-39"><a class="lnlinks" href="#hl-0-39">39</a>
</span><span class="lnt" id="hl-0-40"><a class="lnlinks" href="#hl-0-40">40</a>
</span><span class="lnt" id="hl-0-41"><a class="lnlinks" href="#hl-0-41">41</a>
</span><span class="lnt" id="hl-0-42"><a class="lnlinks" href="#hl-0-42">42</a>
</span><span class="lnt" id="hl-0-43"><a class="lnlinks" href="#hl-0-43">43</a>
</span><span class="lnt" id="hl-0-44"><a class="lnlinks" href="#hl-0-44">44</a>
</span><span class="lnt" id="hl-0-45"><a class="lnlinks" href="#hl-0-45">45</a>
</span><span class="lnt" id="hl-0-46"><a class="lnlinks" href="#hl-0-46">46</a>
</span><span class="lnt" id="hl-0-47"><a class="lnlinks" href="#hl-0-47">47</a>
</span><span class="lnt" id="hl-0-48"><a class="lnlinks" href="#hl-0-48">48</a>
</span><span class="lnt" id="hl-0-49"><a class="lnlinks" href="#hl-0-49">49</a>
</span><span class="lnt" id="hl-0-50"><a class="lnlinks" href="#hl-0-50">50</a>
</span><span class="lnt" id="hl-0-51"><a class="lnlinks" href="#hl-0-51">51</a>
</span><span class="lnt" id="hl-0-52"><a class="lnlinks" href="#hl-0-52">52</a>
</span><span class="lnt" id="hl-0-53"><a class="lnlinks" href="#hl-0-53">53</a>
</span><span class="lnt" id="hl-0-54"><a class="lnlinks" href="#hl-0-54">54</a>
</span><span class="lnt" id="hl-0-55"><a class="lnlinks" href="#hl-0-55">55</a>
</span><span class="lnt" id="hl-0-56"><a class="lnlinks" href="#hl-0-56">56</a>
</span><span class="lnt" id="hl-0-57"><a class="lnlinks" href="#hl-0-57">57</a>
</span><span class="lnt" id="hl-0-58"><a class="lnlinks" href="#hl-0-58">58</a>
</span><span class="lnt" id="hl-0-59"><a class="lnlinks" href="#hl-0-59">59</a>
</span><span class="lnt" id="hl-0-60"><a class="lnlinks" href="#hl-0-60">60</a>
</span><span class="lnt" id="hl-0-61"><a class="lnlinks" href="#hl-0-61">61</a>
</span><span class="lnt" id="hl-0-62"><a class="lnlinks" href="#hl-0-62">62</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-C++" data-lang="C++"><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&lt;iostream&gt;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;console.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;SimpleTest.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;strlib.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="n">string</span> <span class="nf">extractAlpha</span><span class="p">(</span><span class="n">string</span> <span class="n">s</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">string</span> <span class="n">result</span><span class="p">;</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">s</span><span class="p">.</span><span class="n">length</span><span class="p">();</span> <span class="n">i</span><span class="o">++</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span><span class="n">isalpha</span><span class="p">(</span><span class="n">s</span><span class="p">[</span><span class="n">i</span><span class="p">]))</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">result</span> <span class="o">+=</span> <span class="n">s</span><span class="p">[</span><span class="n">i</span><span class="p">];</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="n">result</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">bool</span> <span class="nf">passwordChecksOut</span><span class="p">(</span><span class="n">string</span> <span class="n">username</span><span class="p">,</span> <span class="n">string</span> <span class="n">password</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">string</span> <span class="n">alphaPortion</span> <span class="o">=</span> <span class="n">extractAlpha</span><span class="p">(</span><span class="n">password</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="o">!</span><span class="n">stringContains</span><span class="p">(</span><span class="n">toLowerCase</span><span class="p">(</span><span class="n">alphaPortion</span><span class="p">),</span> <span class="n">toLowerCase</span><span class="p">(</span><span class="n">username</span><span class="p">));</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="n">STUDENT_TEST</span><span class="p">(</span><span class="s">&#34;various tests of extractAlpha() function&#34;</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">extractAlpha</span><span class="p">(</span><span class="s">&#34;sean&#34;</span><span class="p">),</span> <span class="s">&#34;sean&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">extractAlpha</span><span class="p">(</span><span class="s">&#34;sean11&#34;</span><span class="p">),</span> <span class="s">&#34;sean&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">extractAlpha</span><span class="p">(</span><span class="s">&#34;1sean&#34;</span><span class="p">),</span> <span class="s">&#34;sean&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">extractAlpha</span><span class="p">(</span><span class="s">&#34;s1ean&#34;</span><span class="p">),</span> <span class="s">&#34;sean&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">extractAlpha</span><span class="p">(</span><span class="s">&#34;s1e1a1n&#34;</span><span class="p">),</span> <span class="s">&#34;sean&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">extractAlpha</span><span class="p">(</span><span class="s">&#34;s9e$a***&amp;n&#34;</span><span class="p">),</span> <span class="s">&#34;sean&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">extractAlpha</span><span class="p">(</span><span class="s">&#34;&#34;</span><span class="p">),</span> <span class="s">&#34;&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">extractAlpha</span><span class="p">(</span><span class="s">&#34;9$&amp;&#34;</span><span class="p">),</span> <span class="s">&#34;&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="n">STUDENT_TEST</span><span class="p">(</span><span class="s">&#34;这是我的测试, 关于函数 passwordChecksOut()&#34;</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">passwordChecksOut</span><span class="p">(</span><span class="s">&#34;dk&#34;</span><span class="p">,</span><span class="s">&#34;d9327309k**%dd&#34;</span><span class="p">),</span> <span class="nb">false</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">EXPECT_EQUAL</span><span class="p">(</span><span class="n">passwordChecksOut</span><span class="p">(</span><span class="s">&#34;dk&#34;</span><span class="p">,</span><span class="s">&#34;kdbusa*7^//&#34;</span><span class="p">),</span><span class="nb">true</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">int</span> <span class="nf">main_test</span><span class="p">()</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">runSimpleTests</span><span class="p">(</span><span class="n">ALL_TESTS</span><span class="p">);</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"> <span class="n">string</span> <span class="n">username</span> <span class="o">=</span> <span class="s">&#34;Sean&#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">string</span> <span class="n">password</span> <span class="o">=</span> <span class="s">&#34;s1e1a1n1&#39;1s1p1a1s1s1w1o1r1d&#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span><span class="n">passwordChecksOut</span><span class="p">(</span><span class="n">username</span><span class="p">,</span> <span class="n">password</span><span class="p">))</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&#34;Hooray!&#34;</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="k">else</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&#34;Oh no! Bad password.&#34;</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span></span></span></code></pre></td></tr></table>
</div>
</div>
<h2 id="作业2">作业2
<a class="header-anchor" href="#%e4%bd%9c%e4%b8%9a2"></a>
</h2><h3 id="简单情形">简单情形
<a class="header-anchor" href="#%e7%ae%80%e5%8d%95%e6%83%85%e5%bd%a2"></a>
</h3>
<blockquote>
<p>Write a function that takes a vector of integers as its only argument and prints it in the following format:</p>
<p>编写一个函数,该函数将整数向量作为其唯一参数,并按以下格式打印:</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-1-1"><a class="lnlinks" href="#hl-1-1">1</a>
</span><span class="lnt" id="hl-1-2"><a class="lnlinks" href="#hl-1-2">2</a>
</span><span class="lnt" id="hl-1-3"><a class="lnlinks" href="#hl-1-3">3</a>
</span><span class="lnt" id="hl-1-4"><a class="lnlinks" href="#hl-1-4">4</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">+----+----+----+----+----+----+
</span></span><span class="line"><span class="cl">| 43 | 19 | 12 | 95 | 83 | 13 |
</span></span><span class="line"><span class="cl">+----+----+----+----+----+----+
</span></span><span class="line"><span class="cl"> 0 1 2 3 4 5</span></span></code></pre></td></tr></table>
</div>
</div>
<p>The function signature is:
函数签名为:</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-2-1"><a class="lnlinks" href="#hl-2-1">1</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">printVector(Vector&lt;int&gt;&amp; v)</span></span></code></pre></td></tr></table>
</div>
</div>
<p>To simplify the problem, you may assume all the integers in the vector have exactly two digits.
为了简化问题,您可以假设向量中的所有整数恰好有两位数字。</p>
</blockquote>
<p>这个问题也是简单的, 因为假设了二位整数所以没有任意整数的困难(包括负数, 位数不同等).</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-3-1"><a class="lnlinks" href="#hl-3-1"> 1</a>
</span><span class="lnt" id="hl-3-2"><a class="lnlinks" href="#hl-3-2"> 2</a>
</span><span class="lnt" id="hl-3-3"><a class="lnlinks" href="#hl-3-3"> 3</a>
</span><span class="lnt" id="hl-3-4"><a class="lnlinks" href="#hl-3-4"> 4</a>
</span><span class="lnt" id="hl-3-5"><a class="lnlinks" href="#hl-3-5"> 5</a>
</span><span class="lnt" id="hl-3-6"><a class="lnlinks" href="#hl-3-6"> 6</a>
</span><span class="lnt" id="hl-3-7"><a class="lnlinks" href="#hl-3-7"> 7</a>
</span><span class="lnt" id="hl-3-8"><a class="lnlinks" href="#hl-3-8"> 8</a>
</span><span class="lnt" id="hl-3-9"><a class="lnlinks" href="#hl-3-9"> 9</a>
</span><span class="lnt" id="hl-3-10"><a class="lnlinks" href="#hl-3-10">10</a>
</span><span class="lnt" id="hl-3-11"><a class="lnlinks" href="#hl-3-11">11</a>
</span><span class="lnt" id="hl-3-12"><a class="lnlinks" href="#hl-3-12">12</a>
</span><span class="lnt" id="hl-3-13"><a class="lnlinks" href="#hl-3-13">13</a>
</span><span class="lnt" id="hl-3-14"><a class="lnlinks" href="#hl-3-14">14</a>
</span><span class="lnt" id="hl-3-15"><a class="lnlinks" href="#hl-3-15">15</a>
</span><span class="lnt" id="hl-3-16"><a class="lnlinks" href="#hl-3-16">16</a>
</span><span class="lnt" id="hl-3-17"><a class="lnlinks" href="#hl-3-17">17</a>
</span><span class="lnt" id="hl-3-18"><a class="lnlinks" href="#hl-3-18">18</a>
</span><span class="lnt" id="hl-3-19"><a class="lnlinks" href="#hl-3-19">19</a>
</span><span class="lnt" id="hl-3-20"><a class="lnlinks" href="#hl-3-20">20</a>
</span><span class="lnt" id="hl-3-21"><a class="lnlinks" href="#hl-3-21">21</a>
</span><span class="lnt" id="hl-3-22"><a class="lnlinks" href="#hl-3-22">22</a>
</span><span class="lnt" id="hl-3-23"><a class="lnlinks" href="#hl-3-23">23</a>
</span><span class="lnt" id="hl-3-24"><a class="lnlinks" href="#hl-3-24">24</a>
</span><span class="lnt" id="hl-3-25"><a class="lnlinks" href="#hl-3-25">25</a>
</span><span class="lnt" id="hl-3-26"><a class="lnlinks" href="#hl-3-26">26</a>
</span><span class="lnt" id="hl-3-27"><a class="lnlinks" href="#hl-3-27">27</a>
</span><span class="lnt" id="hl-3-28"><a class="lnlinks" href="#hl-3-28">28</a>
</span><span class="lnt" id="hl-3-29"><a class="lnlinks" href="#hl-3-29">29</a>
</span><span class="lnt" id="hl-3-30"><a class="lnlinks" href="#hl-3-30">30</a>
</span><span class="lnt" id="hl-3-31"><a class="lnlinks" href="#hl-3-31">31</a>
</span><span class="lnt" id="hl-3-32"><a class="lnlinks" href="#hl-3-32">32</a>
</span><span class="lnt" id="hl-3-33"><a class="lnlinks" href="#hl-3-33">33</a>
</span><span class="lnt" id="hl-3-34"><a class="lnlinks" href="#hl-3-34">34</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-C++" data-lang="C++"><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&lt;iostream&gt;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;console.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;SimpleTest.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;vector.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;string.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">void</span> <span class="nf">printVector</span><span class="p">(</span><span class="n">Vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;&amp;</span> <span class="n">v</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">string</span> <span class="n">s1</span><span class="p">,</span> <span class="n">s2</span><span class="p">,</span> <span class="n">s3</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="kt">int</span> <span class="n">count</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="nl">i</span> <span class="p">:</span> <span class="n">v</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">s1</span> <span class="o">+=</span> <span class="s">&#34;+----&#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">s2</span> <span class="o">+=</span> <span class="s">&#34;| &#34;</span> <span class="o">+</span> <span class="n">to_string</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="o">+</span> <span class="s">&#34; &#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">s3</span> <span class="o">+=</span> <span class="s">&#34; &#34;</span> <span class="o">+</span> <span class="n">to_string</span><span class="p">(</span><span class="n">count</span><span class="p">)</span> <span class="o">+</span> <span class="s">&#34; &#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="o">++</span><span class="n">count</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="n">s1</span> <span class="o">+=</span> <span class="s">&#34;+&#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">s2</span> <span class="o">+=</span> <span class="s">&#34;|&#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="n">s1</span> <span class="o">&lt;&lt;</span> <span class="s">&#34;</span><span class="se">\n</span><span class="s">&#34;</span>
</span></span><span class="line"><span class="cl"> <span class="o">&lt;&lt;</span> <span class="n">s2</span> <span class="o">&lt;&lt;</span> <span class="s">&#34;</span><span class="se">\n</span><span class="s">&#34;</span>
</span></span><span class="line"><span class="cl"> <span class="o">&lt;&lt;</span> <span class="n">s1</span> <span class="o">&lt;&lt;</span> <span class="s">&#34;</span><span class="se">\n</span><span class="s">&#34;</span>
</span></span><span class="line"><span class="cl"> <span class="o">&lt;&lt;</span> <span class="n">s3</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">int</span> <span class="nf">main_printVector</span><span class="p">()</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">Vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="n">v1</span> <span class="o">=</span> <span class="p">{</span><span class="mi">43</span><span class="p">,</span> <span class="mi">19</span><span class="p">,</span> <span class="mi">12</span><span class="p">,</span> <span class="mi">95</span><span class="p">,</span> <span class="mi">83</span><span class="p">,</span> <span class="mi">13</span><span class="p">};</span>
</span></span><span class="line"><span class="cl"> <span class="n">printVector</span><span class="p">(</span><span class="n">v1</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="c1">// cout &lt;&lt; &#34;+----+----+----+----+----+----+\n| 43 | 19 | 12 | 95 | 83 | 13 |\n+----+----+----+----+----+----+\n 0 1 2 3 4 5&#34;;
</span></span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span></span></span></code></pre></td></tr></table>
</div>
</div>
<h3 id="改进">改进
<a class="header-anchor" href="#%e6%94%b9%e8%bf%9b"></a>
</h3>
<blockquote>
<p>Additional challenge (this is fairly advanced; don&rsquo;t worry too much about this one if you don&rsquo;t have time):
额外的挑战(这是相当高级的,如果你没有时间,不要太担心这个):</p>
<ul>
<li>How could you ensure when printing the contents of a vector that the largest box has exactly enough space for the largest integer in the vector to be surrounded by one space on either side, and all other boxes have the same amount of space, with each integer being centered within its cell to the extend possible? For example:
在打印向量的内容时,如何确保最大的框有足够的空间让向量中最大的整数在两侧被一个空格包围,并且所有其他框具有相同的空间量,每个整数在其单元格内居中,尽可能地扩大? 例如:</li>
</ul>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-4-1"><a class="lnlinks" href="#hl-4-1">1</a>
</span><span class="lnt" id="hl-4-2"><a class="lnlinks" href="#hl-4-2">2</a>
</span><span class="lnt" id="hl-4-3"><a class="lnlinks" href="#hl-4-3">3</a>
</span><span class="lnt" id="hl-4-4"><a class="lnlinks" href="#hl-4-4">4</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">+------+------+------+------+------+------+
</span></span><span class="line"><span class="cl">| 43 | 1 | 9 | 129 | 5821 | 3 |
</span></span><span class="line"><span class="cl">+------+------+------+------+------+------+
</span></span><span class="line"><span class="cl"> 0 1 2 3 4 5</span></span></code></pre></td></tr></table>
</div>
</div>
</blockquote>
<p>这里位数不同的问题应该是普遍意识到的问题, 但是还有一个问题在于我们事实上是可以考虑负数的情形的但是这样需要考虑一些额外的情况.</p>
<blockquote>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-5-1"><a class="lnlinks" href="#hl-5-1">1</a>
</span><span class="lnt" id="hl-5-2"><a class="lnlinks" href="#hl-5-2">2</a>
</span><span class="lnt" id="hl-5-3"><a class="lnlinks" href="#hl-5-3">3</a>
</span><span class="lnt" id="hl-5-4"><a class="lnlinks" href="#hl-5-4">4</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback"><span class="line"><span class="cl">+-------+-------+-------+-------+-------+-------+-------+
</span></span><span class="line"><span class="cl">| 43 | 1 | 9 | 129 | 5821 | 3 | -5633 |
</span></span><span class="line"><span class="cl">+-------+-------+-------+-------+-------+-------+-------+
</span></span><span class="line"><span class="cl"> 0 1 2 3 4 5 6 </span></span></code></pre></td></tr></table>
</div>
</div>
</blockquote>
<p>如图所示存在问题: 计算整数位数时, 负数需要计算-号也会占用一个位置.</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-6-1"><a class="lnlinks" href="#hl-6-1"> 1</a>
</span><span class="lnt" id="hl-6-2"><a class="lnlinks" href="#hl-6-2"> 2</a>
</span><span class="lnt" id="hl-6-3"><a class="lnlinks" href="#hl-6-3"> 3</a>
</span><span class="lnt" id="hl-6-4"><a class="lnlinks" href="#hl-6-4"> 4</a>
</span><span class="lnt" id="hl-6-5"><a class="lnlinks" href="#hl-6-5"> 5</a>
</span><span class="lnt" id="hl-6-6"><a class="lnlinks" href="#hl-6-6"> 6</a>
</span><span class="lnt" id="hl-6-7"><a class="lnlinks" href="#hl-6-7"> 7</a>
</span><span class="lnt" id="hl-6-8"><a class="lnlinks" href="#hl-6-8"> 8</a>
</span><span class="lnt" id="hl-6-9"><a class="lnlinks" href="#hl-6-9"> 9</a>
</span><span class="lnt" id="hl-6-10"><a class="lnlinks" href="#hl-6-10">10</a>
</span><span class="lnt" id="hl-6-11"><a class="lnlinks" href="#hl-6-11">11</a>
</span><span class="lnt" id="hl-6-12"><a class="lnlinks" href="#hl-6-12">12</a>
</span><span class="lnt" id="hl-6-13"><a class="lnlinks" href="#hl-6-13">13</a>
</span><span class="lnt" id="hl-6-14"><a class="lnlinks" href="#hl-6-14">14</a>
</span><span class="lnt" id="hl-6-15"><a class="lnlinks" href="#hl-6-15">15</a>
</span><span class="lnt" id="hl-6-16"><a class="lnlinks" href="#hl-6-16">16</a>
</span><span class="lnt" id="hl-6-17"><a class="lnlinks" href="#hl-6-17">17</a>
</span><span class="lnt" id="hl-6-18"><a class="lnlinks" href="#hl-6-18">18</a>
</span><span class="lnt" id="hl-6-19"><a class="lnlinks" href="#hl-6-19">19</a>
</span><span class="lnt" id="hl-6-20"><a class="lnlinks" href="#hl-6-20">20</a>
</span><span class="lnt" id="hl-6-21"><a class="lnlinks" href="#hl-6-21">21</a>
</span><span class="lnt" id="hl-6-22"><a class="lnlinks" href="#hl-6-22">22</a>
</span><span class="lnt" id="hl-6-23"><a class="lnlinks" href="#hl-6-23">23</a>
</span><span class="lnt" id="hl-6-24"><a class="lnlinks" href="#hl-6-24">24</a>
</span><span class="lnt" id="hl-6-25"><a class="lnlinks" href="#hl-6-25">25</a>
</span><span class="lnt" id="hl-6-26"><a class="lnlinks" href="#hl-6-26">26</a>
</span><span class="lnt" id="hl-6-27"><a class="lnlinks" href="#hl-6-27">27</a>
</span><span class="lnt" id="hl-6-28"><a class="lnlinks" href="#hl-6-28">28</a>
</span><span class="lnt" id="hl-6-29"><a class="lnlinks" href="#hl-6-29">29</a>
</span><span class="lnt" id="hl-6-30"><a class="lnlinks" href="#hl-6-30">30</a>
</span><span class="lnt" id="hl-6-31"><a class="lnlinks" href="#hl-6-31">31</a>
</span><span class="lnt" id="hl-6-32"><a class="lnlinks" href="#hl-6-32">32</a>
</span><span class="lnt" id="hl-6-33"><a class="lnlinks" href="#hl-6-33">33</a>
</span><span class="lnt" id="hl-6-34"><a class="lnlinks" href="#hl-6-34">34</a>
</span><span class="lnt" id="hl-6-35"><a class="lnlinks" href="#hl-6-35">35</a>
</span><span class="lnt" id="hl-6-36"><a class="lnlinks" href="#hl-6-36">36</a>
</span><span class="lnt" id="hl-6-37"><a class="lnlinks" href="#hl-6-37">37</a>
</span><span class="lnt" id="hl-6-38"><a class="lnlinks" href="#hl-6-38">38</a>
</span><span class="lnt" id="hl-6-39"><a class="lnlinks" href="#hl-6-39">39</a>
</span><span class="lnt" id="hl-6-40"><a class="lnlinks" href="#hl-6-40">40</a>
</span><span class="lnt" id="hl-6-41"><a class="lnlinks" href="#hl-6-41">41</a>
</span><span class="lnt" id="hl-6-42"><a class="lnlinks" href="#hl-6-42">42</a>
</span><span class="lnt" id="hl-6-43"><a class="lnlinks" href="#hl-6-43">43</a>
</span><span class="lnt" id="hl-6-44"><a class="lnlinks" href="#hl-6-44">44</a>
</span><span class="lnt" id="hl-6-45"><a class="lnlinks" href="#hl-6-45">45</a>
</span><span class="lnt" id="hl-6-46"><a class="lnlinks" href="#hl-6-46">46</a>
</span><span class="lnt" id="hl-6-47"><a class="lnlinks" href="#hl-6-47">47</a>
</span><span class="lnt" id="hl-6-48"><a class="lnlinks" href="#hl-6-48">48</a>
</span><span class="lnt" id="hl-6-49"><a class="lnlinks" href="#hl-6-49">49</a>
</span><span class="lnt" id="hl-6-50"><a class="lnlinks" href="#hl-6-50">50</a>
</span><span class="lnt" id="hl-6-51"><a class="lnlinks" href="#hl-6-51">51</a>
</span><span class="lnt" id="hl-6-52"><a class="lnlinks" href="#hl-6-52">52</a>
</span><span class="lnt" id="hl-6-53"><a class="lnlinks" href="#hl-6-53">53</a>
</span><span class="lnt" id="hl-6-54"><a class="lnlinks" href="#hl-6-54">54</a>
</span><span class="lnt" id="hl-6-55"><a class="lnlinks" href="#hl-6-55">55</a>
</span><span class="lnt" id="hl-6-56"><a class="lnlinks" href="#hl-6-56">56</a>
</span><span class="lnt" id="hl-6-57"><a class="lnlinks" href="#hl-6-57">57</a>
</span><span class="lnt" id="hl-6-58"><a class="lnlinks" href="#hl-6-58">58</a>
</span><span class="lnt" id="hl-6-59"><a class="lnlinks" href="#hl-6-59">59</a>
</span><span class="lnt" id="hl-6-60"><a class="lnlinks" href="#hl-6-60">60</a>
</span><span class="lnt" id="hl-6-61"><a class="lnlinks" href="#hl-6-61">61</a>
</span><span class="lnt" id="hl-6-62"><a class="lnlinks" href="#hl-6-62">62</a>
</span><span class="lnt" id="hl-6-63"><a class="lnlinks" href="#hl-6-63">63</a>
</span><span class="lnt" id="hl-6-64"><a class="lnlinks" href="#hl-6-64">64</a>
</span><span class="lnt" id="hl-6-65"><a class="lnlinks" href="#hl-6-65">65</a>
</span><span class="lnt" id="hl-6-66"><a class="lnlinks" href="#hl-6-66">66</a>
</span><span class="lnt" id="hl-6-67"><a class="lnlinks" href="#hl-6-67">67</a>
</span><span class="lnt" id="hl-6-68"><a class="lnlinks" href="#hl-6-68">68</a>
</span><span class="lnt" id="hl-6-69"><a class="lnlinks" href="#hl-6-69">69</a>
</span><span class="lnt" id="hl-6-70"><a class="lnlinks" href="#hl-6-70">70</a>
</span><span class="lnt" id="hl-6-71"><a class="lnlinks" href="#hl-6-71">71</a>
</span><span class="lnt" id="hl-6-72"><a class="lnlinks" href="#hl-6-72">72</a>
</span><span class="lnt" id="hl-6-73"><a class="lnlinks" href="#hl-6-73">73</a>
</span><span class="lnt" id="hl-6-74"><a class="lnlinks" href="#hl-6-74">74</a>
</span><span class="lnt" id="hl-6-75"><a class="lnlinks" href="#hl-6-75">75</a>
</span><span class="lnt" id="hl-6-76"><a class="lnlinks" href="#hl-6-76">76</a>
</span><span class="lnt" id="hl-6-77"><a class="lnlinks" href="#hl-6-77">77</a>
</span><span class="lnt" id="hl-6-78"><a class="lnlinks" href="#hl-6-78">78</a>
</span><span class="lnt" id="hl-6-79"><a class="lnlinks" href="#hl-6-79">79</a>
</span><span class="lnt" id="hl-6-80"><a class="lnlinks" href="#hl-6-80">80</a>
</span><span class="lnt" id="hl-6-81"><a class="lnlinks" href="#hl-6-81">81</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-C++" data-lang="C++"><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&lt;iostream&gt;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;console.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;SimpleTest.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;string.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&#34;vector.h&#34;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">int</span> <span class="nf">widthOfNum</span><span class="p">(</span><span class="kt">int</span> <span class="n">num</span><span class="p">){</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span><span class="n">num</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">1</span><span class="p">;</span> <span class="c1">// 0是1位数
</span></span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"> <span class="kt">int</span> <span class="n">count</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="c1">// 处理负数:转换为正数
</span></span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span><span class="n">num</span> <span class="o">&lt;</span> <span class="mi">0</span><span class="p">)</span> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">num</span> <span class="o">=</span> <span class="o">-</span><span class="n">num</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="o">++</span><span class="n">count</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"> <span class="k">while</span> <span class="p">(</span><span class="n">num</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">count</span><span class="o">++</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">num</span> <span class="o">/=</span> <span class="mi">10</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="n">count</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">int</span> <span class="nf">maxWidthOfVector</span><span class="p">(</span><span class="n">Vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="n">v</span><span class="p">){</span>
</span></span><span class="line"><span class="cl"> <span class="kt">int</span> <span class="n">numVec</span> <span class="o">=</span> <span class="n">v</span><span class="p">.</span><span class="n">size</span><span class="p">();</span>
</span></span><span class="line"><span class="cl"> <span class="kt">int</span> <span class="n">maxNum</span> <span class="o">=</span> <span class="n">widthOfNum</span><span class="p">(</span><span class="n">v</span><span class="p">[</span><span class="mi">0</span><span class="p">]);</span>
</span></span><span class="line"><span class="cl"> <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span> <span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">numVec</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">){</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span><span class="p">(</span><span class="n">widthOfNum</span><span class="p">(</span><span class="n">v</span><span class="p">[</span><span class="n">i</span><span class="p">])</span> <span class="o">&gt;</span> <span class="n">maxNum</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span><span class="n">maxNum</span> <span class="o">=</span> <span class="n">widthOfNum</span><span class="p">(</span><span class="n">v</span><span class="p">[</span><span class="n">i</span><span class="p">]);}</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="n">maxNum</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">void</span> <span class="nf">printVectorAdvanced</span><span class="p">(</span><span class="n">Vector</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="n">v</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="c1">//runSimpleTests(SELECTED_TESTS);