-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
399 lines (327 loc) · 39.6 KB
/
index.html
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
<!DOCTYPE html><html lang="zh-CN" data-theme="light"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width,initial-scale=1"><title>Wablers</title><meta name="author" content="Lin"><meta name="copyright" content="Lin"><meta name="format-detection" content="telephone=no"><meta name="theme-color" content="#ffffff"><meta name="description" content="Share as You Wish to Update">
<meta property="og:type" content="website">
<meta property="og:title" content="Wablers">
<meta property="og:url" content="http://example.com/index.html">
<meta property="og:site_name" content="Wablers">
<meta property="og:description" content="Share as You Wish to Update">
<meta property="og:locale" content="zh_CN">
<meta property="og:image" content="http://example.com/img/avatar.jpg">
<meta property="article:author" content="Lin">
<meta name="twitter:card" content="summary">
<meta name="twitter:image" content="http://example.com/img/avatar.jpg"><link rel="shortcut icon" href="/img/favicon.jpg"><link rel="canonical" href="http://example.com/"><link rel="preconnect" href="//cdn.jsdelivr.net"/><link rel="preconnect" href="//www.google-analytics.com" crossorigin=""/><link rel="preconnect" href="//hm.baidu.com"/><link rel="preconnect" href="//busuanzi.ibruce.info"/><link rel="stylesheet" href="/css/index.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fortawesome/fontawesome-free/css/all.min.css" media="print" onload="this.media='all'"><script>var _hmt = _hmt || [];
(function() {
var hm = document.createElement("script");
hm.src = "https://hm.baidu.com/hm.js?292a248418141690f958c1ffeccc9c3e";
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(hm, s);
})();
</script><script async="async" src="https://www.googletagmanager.com/gtag/js?id=G-56QZV30ZCS"></script><script>window.dataLayer = window.dataLayer || [];
function gtag(){dataLayer.push(arguments);}
gtag('js', new Date());
gtag('config', 'G-56QZV30ZCS');
</script><script>const GLOBAL_CONFIG = {
root: '/',
algolia: undefined,
localSearch: undefined,
translate: undefined,
noticeOutdate: undefined,
highlight: {"plugin":"highlighjs","highlightCopy":true,"highlightLang":true,"highlightHeightLimit":false},
copy: {
success: '复制成功',
error: '复制错误',
noSupport: '浏览器不支持'
},
relativeDate: {
homepage: false,
post: false
},
runtime: '',
date_suffix: {
just: '刚刚',
min: '分钟前',
hour: '小时前',
day: '天前',
month: '个月前'
},
copyright: {"limitCount":50,"languages":{"author":"作者: Lin","link":"链接: ","source":"来源: Wablers","info":"著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。"}},
lightbox: 'fancybox',
Snackbar: undefined,
source: {
jQuery: 'https://cdn.jsdelivr.net/npm/jquery@latest/dist/jquery.min.js',
justifiedGallery: {
js: 'https://cdn.jsdelivr.net/npm/justifiedGallery/dist/js/jquery.justifiedGallery.min.js',
css: 'https://cdn.jsdelivr.net/npm/justifiedGallery/dist/css/justifiedGallery.min.css'
},
fancybox: {
js: 'https://cdn.jsdelivr.net/npm/@fancyapps/fancybox@latest/dist/jquery.fancybox.min.js',
css: 'https://cdn.jsdelivr.net/npm/@fancyapps/fancybox@latest/dist/jquery.fancybox.min.css'
}
},
isPhotoFigcaption: false,
islazyload: false,
isanchor: false
}</script><script id="config-diff">var GLOBAL_CONFIG_SITE = {
title: 'Wablers',
isPost: false,
isHome: true,
isHighlightShrink: false,
isToc: false,
postUpdate: '2023-01-31 13:18:34'
}</script><noscript><style type="text/css">
#nav {
opacity: 1
}
.justified-gallery img {
opacity: 1
}
#recent-posts time,
#post-meta time {
display: inline !important
}
</style></noscript><script>(win=>{
win.saveToLocal = {
set: function setWithExpiry(key, value, ttl) {
if (ttl === 0) return
const now = new Date()
const expiryDay = ttl * 86400000
const item = {
value: value,
expiry: now.getTime() + expiryDay,
}
localStorage.setItem(key, JSON.stringify(item))
},
get: function getWithExpiry(key) {
const itemStr = localStorage.getItem(key)
if (!itemStr) {
return undefined
}
const item = JSON.parse(itemStr)
const now = new Date()
if (now.getTime() > item.expiry) {
localStorage.removeItem(key)
return undefined
}
return item.value
}
}
win.getScript = url => new Promise((resolve, reject) => {
const script = document.createElement('script')
script.src = url
script.async = true
script.onerror = reject
script.onload = script.onreadystatechange = function() {
const loadState = this.readyState
if (loadState && loadState !== 'loaded' && loadState !== 'complete') return
script.onload = script.onreadystatechange = null
resolve()
}
document.head.appendChild(script)
})
win.activateDarkMode = function () {
document.documentElement.setAttribute('data-theme', 'dark')
if (document.querySelector('meta[name="theme-color"]') !== null) {
document.querySelector('meta[name="theme-color"]').setAttribute('content', '#0d0d0d')
}
}
win.activateLightMode = function () {
document.documentElement.setAttribute('data-theme', 'light')
if (document.querySelector('meta[name="theme-color"]') !== null) {
document.querySelector('meta[name="theme-color"]').setAttribute('content', '#ffffff')
}
}
const t = saveToLocal.get('theme')
if (t === 'dark') activateDarkMode()
else if (t === 'light') activateLightMode()
const asideStatus = saveToLocal.get('aside-status')
if (asideStatus !== undefined) {
if (asideStatus === 'hide') {
document.documentElement.classList.add('hide-aside')
} else {
document.documentElement.classList.remove('hide-aside')
}
}
const detectApple = () => {
if (GLOBAL_CONFIG_SITE.isHome && /iPad|iPhone|iPod|Macintosh/.test(navigator.userAgent)){
document.documentElement.classList.add('apple')
}
}
detectApple()
})(window)</script><meta name="generator" content="Hexo 5.3.0"></head><body><div id="sidebar"><div id="menu-mask"></div><div id="sidebar-menus"><div class="avatar-img is-center"><img src="/img/avatar.jpg" onerror="onerror=null;src='/img/friend_404.gif'" alt="avatar"/></div><div class="site-data"><div class="data-item is-center"><div class="data-item-link"><a href="/archives/"><div class="headline">文章</div><div class="length-num">42</div></a></div></div><div class="data-item is-center"><div class="data-item-link"><a href="/tags/"><div class="headline">标签</div><div class="length-num">44</div></a></div></div><div class="data-item is-center"><div class="data-item-link"><a href="/categories/"><div class="headline">分类</div><div class="length-num">18</div></a></div></div></div><hr/><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> Home</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> Archives</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> Tags</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> Categories</span></a></div></div></div></div><div class="page" id="body-wrap"><header class="full_page" id="page-header" style="background-image: url('https://s2.loli.net/2022/04/17/ghjfKsQBuG4oAMt.jpg')"><nav id="nav"><span id="blog_name"><a id="site-name" href="/">Wablers</a></span><div id="menus"><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> Home</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> Archives</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> Tags</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> Categories</span></a></div></div><div id="toggle-menu"><a class="site-page"><i class="fas fa-bars fa-fw"></i></a></div></div></nav><div id="site-info"><h1 id="site-title">Wablers</h1><div id="site-subtitle"><span id="subtitle"></span></div><div id="site_social_icons"><a class="social-icon" href="mailto:wablers@163.com" target="_blank" title="Email"><i class="fas fa-envelope"></i></a></div></div><div id="scroll-down"><i class="fas fa-angle-down scroll-down-effects"></i></div></header><main class="layout" id="content-inner"><div class="recent-posts" id="recent-posts"><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2023/01/14/LeetCode%E2%80%94%E2%80%94%E9%93%BE%E8%A1%A8/" title="LeetCode——链表">LeetCode——链表</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2023-01-14T04:29:47.000Z" title="发表于 2023-01-14 12:29:47">2023-01-14</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/LeetCode/">LeetCode</a></span></div><div class="content">链表的定义C++定义链表方式，如下所示：
123456// 单链表struct ListNode { int val; // 节点上存储的元素 ListNode *next; // 指向下一个节点的指针 ListNode(int x) : val(x), next(NULL) {} // 节点的构造函数}
自定义构造函数与默认构造函数的区别：
通过自己定义构造函数初始化节点
1ListNode* head = new ListNode(5);
使用默认构造函数初始化节点
12ListNode* head = new ListNode();head->val = 5;
所以如果不定义构造函数使用默认构造函数的话，在初始化的时候就不能直接给变量赋值。
LeetCode 203. 移除链表元素设置一个虚拟头结点，这样原链表的所有节点就都可以按照统一的方式进行移除
1234567891011121314151617181920class Solution {public: ListNode* rem ...</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2023/01/02/LeetCode%E2%80%94%E2%80%94%E6%95%B0%E7%BB%84/" title="LeetCode——数组">LeetCode——数组</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2023-01-02T07:10:45.000Z" title="发表于 2023-01-02 15:10:45">2023-01-02</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/LeetCode/">LeetCode</a></span></div><div class="content">
数组元素不能删除，只能覆盖
vector的底层实现是array，严格来讲vector是容器，不是数组
LeetCode 704. 二分查找二分法的第一种写法定义 target 在一个左闭右闭的区间里，也就是[left, right] （这个很重要非常重要）
while (left <= right) 要使用 <= ，因为left == right是有意义的，所以使用 <=
if (nums[middle] > target) right 要赋值为 middle - 1，因为当前这个nums[middle]一定不是target，那么接下来要查找的左区间结束下标位置就是 middle - 1
1234567891011121314151617181920// 版本一class Solution {public: int search(vector<int>& nums, int target) { int left = 0; int right = nums.size() - 1; / ...</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2022/12/30/Mesh%E7%BB%84%E7%BD%91%E4%B9%8B%E5%8D%95%E7%BA%BF%E5%A4%8D%E7%94%A8%E4%B8%8EVLAN%E7%BD%91%E5%8F%A3%E5%A4%8D%E7%94%A8/" title="Mesh组网之单线复用与VLAN网口复用">Mesh组网之单线复用与VLAN网口复用</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-12-30T13:17:13.000Z" title="发表于 2022-12-30 21:17:13">2022-12-30</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E7%BD%91%E7%BB%9C/">网络</a></span></div><div class="content">前提背景时间：2022年12月28日
基础：精装修房子，每个房间一个网口且弱电箱在门口玄关柜
目的：实现全屋网络覆盖，无缝漫游
准备：两台路由器；两台VLAN交换机；若干网线
当前网络走线：
网线均是超五类线，没能上到超六类很是可惜，但也还是能满足千兆宽带。
IEEE802.1Q 与 VLAN 知识根据IEEE 802.1Q 协议也就是“Virtual Bridged Local Area Networks”（虚拟桥接局域网，简称“虚拟局域网”）协议，主要规定了 VLAN 的实现方法，要使交换机能够分辨不同VLAN的报文，需要在报文中添加标识VLAN信息的字段。
协议规定，在以太网数据帧的目的MAC地址和源MAC地址字段之后、协议类型字段之前加入4个字节的VLAN标签（又称VLAN Tag，简称Tag），用于标识数据帧所属的VLAN：
在一个VLAN交换网络中，以太网帧主要有以下两种形式：
有标记帧（Tagged帧）：加入了4字节VLAN标签的帧。
无标记帧（Untagged帧）：原始的、未加入4字节VLAN标签的帧。
以太网链路包括接入链路（Access Link）和干道链路 ...</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2022/12/29/Game-Theory%E2%80%94%E2%80%94%E5%8D%9A%E5%BC%88%E8%AE%BA/" title="Game Theory —— 博弈论">Game Theory —— 博弈论</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-12-29T07:43:05.000Z" title="发表于 2022-12-29 15:43:05">2022-12-29</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/Game-Theory/">Game Theory</a></span></div><div class="content">ECON 159: Game Theory1. Introduction: five first lessonsDefinition. My strategy $\alpha$ strictly dominates $\beta$ my strategy if my payoff from $\alpha$ is strictly higher than $\beta$ that from regardless of others’ choices.
Lesson 1. You should never play a strictly dominated strategy.
Lesson 2. Rational play by rational players can lead to bad outcomes.
Lesson 3. To figure out what actions you should choose in a game, a good first step is to figure out what are your payoffs (what do yo ...</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2022/06/12/%E8%BD%AF%E4%BB%B6%E6%B5%8B%E8%AF%95%E4%B8%8A%E6%9C%BA%E5%AE%9E%E9%AA%8C/" title="软件测试上机实验">软件测试上机实验</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-06-12T10:54:30.000Z" title="发表于 2022-06-12 18:54:30">2022-06-12</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/SchoolTask/">SchoolTask</a></span></div><div class="content">使用说明Centos12345678# 用户名root# 密码root# es用户yjy# 密码root
数据库导入 t_test.sql
项目修改
自行修改 mysite 项目中 views.py 和 arg_helpers.py
views.py：
1es = Elasticsearch('http://192.168.31.13:9200')
arg_helpers.py：
123456class args: mysql_host='192.168.31.189' mysql_port=3306 mysql_user='root' mysql_password='root' mysql_database='software_test'
自行修改 vue_test 项目中 config\index.js
index.js：
123456789proxyTable: { '/searchKeyWord':& ...</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2022/03/10/%E6%89%8B%E7%AE%97KMP%E7%AE%97%E6%B3%95%E7%9A%84next%E6%95%B0%E7%BB%84%E5%80%BC%E5%92%8Cnextval%E6%95%B0%E7%BB%84%E5%80%BC/" title="手算KMP算法的 next 数组值和 nextval 数组值">手算KMP算法的 next 数组值和 nextval 数组值</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-03-09T16:24:42.000Z" title="发表于 2022-03-10 00:24:42">2022-03-10</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E8%80%83%E7%A0%94%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/">考研数据结构</a></span></div><div class="content">求next数组求解方法：根据模式串下标分情况计算！
若模式串下标从 “1” 开始
next 数组中第一位写 0，第二位写 1。
求解后面每个元组的 next 值时，将该元素A的前一个元素B与其 next 值所对应下标的元素C进行比较：如果B与C相同，则将元素B的 next 值 +1 作为当前元素A的 next 值；否则，将前一个元素B和C的next值所对应的元素进行比较，如果相同，则将元素C的 next 值 +1 作为当前元素A的 next 值，以此重复操作。
如果找到模式串最前面都找不到相同的元素，则将元素A的 next 值赋为 1。
过程如下：
第一步：填入0，1
下标
1
2
3
4
5
6
7
8
9
模式串
a
b
a
a
b
c
a
b
a
next
0
1
第二步：比较第二个元素和其 next 值所对应下标的元素，不相同。则当前所求第三个元素 next 值赋为 1
下标
1
2
3
4
5
6
7
8
9
模式串
a
b
a
a
b
c
a
b
a
next
0
1
1
第三步 ...</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2022/01/30/2022%E6%96%B0%E5%B9%B4%E5%80%92%E8%AE%A1%E6%97%B6%E7%83%9F%E8%8A%B1/" title="2022新年倒计时烟花">2022新年倒计时烟花</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-01-30T14:17:40.000Z" title="发表于 2022-01-30 22:17:40">2022-01-30</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/Celebration/">Celebration</a></span></div><div class="content">fireworksBased on the work of two authors on CODEPEN with slight modifications
Resource
Countdown Timer
Firework Simulator v2
DemoYou can watch the final product on wablers.xyz/fireworks
DownloadYou can download the zip from Releases
</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2022/01/16/%E5%AF%92%E5%81%87%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98%E2%80%94%E2%80%94%E5%A5%B6%E7%89%9B%E6%A3%92%E7%90%83/" title="寒假每日一题——奶牛棒球">寒假每日一题——奶牛棒球</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-01-16T03:54:10.000Z" title="发表于 2022-01-16 11:54:10">2022-01-16</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E5%AF%92%E5%81%87%E6%AF%8F%E6%97%A5%E4%B8%80%E9%A2%98/">寒假每日一题</a></span></div><div class="content">奶牛棒球农夫约翰的 NN 头奶牛排成一排，每头奶牛都位于数轴中的不同位置上。
它们正在练习投掷棒球。
农夫约翰观看时，观察到一组三头牛 $(X,Y,Z)$ 完成了两次成功的投掷。
牛 XX 把球扔给她右边的牛 $Y$，然后牛 $Y$ 把球扔给她右边的牛 $Z$。
约翰指出，第二次投掷的距离不少于第一次投掷的距离，也不超过第一次投掷的距离的两倍。
请计算共有多少组牛 $(X,Y,Z)$ 可能是约翰所看到的。
输入格式第一行包含整数 $N$4。
接下来 $N$ 行，每行描述一头牛的位置。
输出格式输出奶牛三元组 $(X,Y,Z)$ 的数量。
$(X,Y,Z)$ 需满足，$Y$ 在 $X$ 的右边，$Z$ 在 $Y$ 的右边，并且从 $Y$ 到 $Z$ 的距离在 $[XY,2XY]$ 之间，其中 $XY$ 表示从 $X$ 到 $Y$ 的距离。
数据范围$3≤N≤1000$,奶牛所在的位置坐标范围 $[0,10^8]$。
输入样例：1234565311074
输出样例：14
样例解释四个可能的奶牛三元组为：$1−3−7,1−4−7,4−7−10,1−4−101−3−7,1−4−7,4−7−10 ...</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2022/01/07/Visual%20C++%20%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E9%A2%98%E5%BA%93%E5%8F%8A%E7%AD%94%E6%A1%88/" title="Visual C++ 程序设计题库及答案">Visual C++ 程序设计题库及答案</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2022-01-07T12:31:19.000Z" title="发表于 2022-01-07 20:31:19">2022-01-07</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/Visual-C-%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1/">Visual C++ 程序设计</a></span></div><div class="content">1. 结合开发经验，阐述总结传统的过程式编程模式的特性。（1）在一个main函数中调用其他函数来完成各种各样的功能
（2）采用顺序的、关联的、过程驱动的程序设计方法一个程序是一系列预定好的操作序列的组合，它具有一定的开头、中间过程和结果
（3）程序直接控制程序事件和过程的顺序
（4）面向程序而不是面向用户，交互性差，用户界面不友好
2. 结合开发经验，解释何为文档与视图 。 文档
（1）文档是一种数据源，数据源最常见的是磁盘文件
（2）负责将数据保存到永久存储介质中，最常见的是保存到磁盘或数据库（串行化）
视图
（1）视图是数据的用户窗口，为用户提供了文档的可视数据显示
（2）视图给用户提供与文档中数据交互的界面
（3）一个文档会有一个或多个视图显示
（4）视图可以直接访问文档类中的这些成员变量，并通过这种方式来显示和更新数据
3. 结合开发经验，总结 MFC类库中窗口类主要包括哪些下属类。（1）窗口类 CWnd（所有窗口类的基类）
（2）框架窗口类
（3）视图类
（4）对话框类
（5）控件类
（6）控件栏类
（6）属性页类
4. 在WINDOWS中， 控件分为哪三类 ...</div></div></div><div class="recent-post-item"><div class="recent-post-info no-cover"><a class="article-title" href="/2021/12/20/%E8%93%9D%E6%A1%A5%E6%9D%AF%E4%B9%8B%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84%E5%92%8C%E7%BA%BF%E6%AE%B5%E6%A0%91/" title="蓝桥杯之树状数组和线段树">蓝桥杯之树状数组和线段树</a><div class="article-meta-wrap"><span class="post-meta-date"><i class="far fa-calendar-alt"></i><span class="article-meta-label">发表于</span><time datetime="2021-12-20T08:27:10.000Z" title="发表于 2021-12-20 16:27:10">2021-12-20</time></span><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox"></i><a class="article-meta__categories" href="/categories/%E8%93%9D%E6%A1%A5%E6%9D%AF/">蓝桥杯</a></span></div><div class="content">蓝桥杯之树状数组和线段树树状数组
lowbit(x):返回x的最后一位1
add(x,v):在x位置加上v，并将后面相关联的位置也加上v
query(x):询问x的前缀和
1. 动态去连续区间和给定 n 个数组成的一个数列，规定有两种操作，一是修改某个元素，二是求子数列 [a,b] 的连续和。
输入格式第一行包含两个整数 n 和 m，分别表示数的个数和操作次数。
第二行包含 n 个整数，表示完整数列。
接下来 m 行，每行包含三个整数 k,a,b （k=0，表示求子数列[a,b] 的和；k=1，表示第 a 个数加 b）。
数列从 1 开始计数。
输出格式输出若干行数字，表示 k=0 时，对应的子数列 [a,b] 的连续和。
数据范围
1≤n≤100000,\\
1≤m≤100000，\\
1≤a≤b≤n数据保证在任何时候，数列中所有元素之和均在 int 范围内。
输入样例：123456710 51 2 3 4 5 6 7 8 9 101 1 50 1 30 4 81 7 50 4 8
输出样例：123113035
AC12345678910111213141516171819202 ...</div></div></div><nav id="pagination"><div class="pagination"><span class="page-number current">1</span><a class="page-number" href="/page/2/#content-inner">2</a><span class="space">…</span><a class="page-number" href="/page/5/#content-inner">5</a><a class="extend next" rel="next" href="/page/2/#content-inner"><i class="fas fa-chevron-right fa-fw"></i></a></div></nav></div><div class="aside-content" id="aside-content"><div class="card-widget card-info"><div class="is-center"><div class="avatar-img"><img src="/img/avatar.jpg" onerror="this.onerror=null;this.src='/img/friend_404.gif'" alt="avatar"/></div><div class="author-info__name">Lin</div><div class="author-info__description">Share as You Wish to Update</div></div><div class="card-info-data"><div class="card-info-data-item is-center"><a href="/archives/"><div class="headline">文章</div><div class="length-num">42</div></a></div><div class="card-info-data-item is-center"><a href="/tags/"><div class="headline">标签</div><div class="length-num">44</div></a></div><div class="card-info-data-item is-center"><a href="/categories/"><div class="headline">分类</div><div class="length-num">18</div></a></div></div><a class="button--animated" id="card-info-btn" target="_blank" rel="noopener" href="https://github.com/LinFallen"><i class="fab fa-github"></i><span>Follow Me</span></a><div class="card-info-social-icons is-center"><a class="social-icon" href="mailto:wablers@163.com" target="_blank" title="Email"><i class="fas fa-envelope"></i></a></div></div><div class="card-widget card-announcement"><div class="item-headline"><i class="fas fa-bullhorn card-announcement-animation"></i><span>公告</span></div><div class="announcement_content">Please email me if you have any questions.</div></div><div class="sticky_layout"><div class="card-widget card-recent-post"><div class="item-headline"><i class="fas fa-history"></i><span>最新文章</span></div><div class="aside-list"><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2023/01/14/LeetCode%E2%80%94%E2%80%94%E9%93%BE%E8%A1%A8/" title="LeetCode——链表">LeetCode——链表</a><time datetime="2023-01-14T04:29:47.000Z" title="发表于 2023-01-14 12:29:47">2023-01-14</time></div></div><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2023/01/02/LeetCode%E2%80%94%E2%80%94%E6%95%B0%E7%BB%84/" title="LeetCode——数组">LeetCode——数组</a><time datetime="2023-01-02T07:10:45.000Z" title="发表于 2023-01-02 15:10:45">2023-01-02</time></div></div><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2022/12/30/Mesh%E7%BB%84%E7%BD%91%E4%B9%8B%E5%8D%95%E7%BA%BF%E5%A4%8D%E7%94%A8%E4%B8%8EVLAN%E7%BD%91%E5%8F%A3%E5%A4%8D%E7%94%A8/" title="Mesh组网之单线复用与VLAN网口复用">Mesh组网之单线复用与VLAN网口复用</a><time datetime="2022-12-30T13:17:13.000Z" title="发表于 2022-12-30 21:17:13">2022-12-30</time></div></div><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2022/12/29/Game-Theory%E2%80%94%E2%80%94%E5%8D%9A%E5%BC%88%E8%AE%BA/" title="Game Theory —— 博弈论">Game Theory —— 博弈论</a><time datetime="2022-12-29T07:43:05.000Z" title="发表于 2022-12-29 15:43:05">2022-12-29</time></div></div><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2022/06/12/%E8%BD%AF%E4%BB%B6%E6%B5%8B%E8%AF%95%E4%B8%8A%E6%9C%BA%E5%AE%9E%E9%AA%8C/" title="软件测试上机实验">软件测试上机实验</a><time datetime="2022-06-12T10:54:30.000Z" title="发表于 2022-06-12 18:54:30">2022-06-12</time></div></div></div></div><div class="card-widget" id="card-newest-comments"><div class="item-headline"><i class="fas fa-comment-dots"></i><span>最新评论</span></div><div class="aside-list"><span>正在加载中...</span></div></div><div class="card-widget card-categories"><div class="item-headline">
<i class="fas fa-folder-open"></i>
<span>分类</span>
<a class="card-more-btn" href="/categories/" title="查看更多">
<i class="fas fa-angle-right"></i></a>
</div>
<ul class="card-category-list" id="aside-cat-list">
<li class="card-category-list-item "><a class="card-category-list-link" href="/categories/C-%E6%8F%90%E9%AB%98/"><span class="card-category-list-name">C++提高</span><span class="card-category-list-count">1</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/C-C-%E8%BF%9B%E9%98%B6/"><span class="card-category-list-name">C/C++进阶</span><span class="card-category-list-count">1</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/Celebration/"><span class="card-category-list-name">Celebration</span><span class="card-category-list-count">1</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/Discipline/"><span class="card-category-list-name">Discipline</span><span class="card-category-list-count">1</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/Game-Theory/"><span class="card-category-list-name">Game Theory</span><span class="card-category-list-count">1</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/JavaScript/"><span class="card-category-list-name">JavaScript</span><span class="card-category-list-count">1</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/LeetCode/"><span class="card-category-list-name">LeetCode</span><span class="card-category-list-count">2</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/PAT%E7%94%B2%E7%BA%A7/"><span class="card-category-list-name">PAT甲级</span><span class="card-category-list-count">1</span></a></li>
</ul></div><div class="card-widget card-tags"><div class="item-headline"><i class="fas fa-tags"></i><span>标签</span></div><div class="card-tag-cloud"><a href="/tags/%E8%AE%A1%E7%AE%97%E6%9C%BA%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/" style="font-size: 1.28em; color: rgb(93, 69, 197)">计算机操作系统</a><a href="/tags/%E6%A6%82%E5%BF%B5%E8%AF%A6%E8%BF%B0/" style="font-size: 1.28em; color: rgb(106, 165, 194)">概念详述</a><a href="/tags/Introspection/" style="font-size: 1.15em; color: rgb(189, 136, 106)">Introspection</a><a href="/tags/New-Year/" style="font-size: 1.15em; color: rgb(138, 26, 0)">New Year</a><a href="/tags/Fireworks/" style="font-size: 1.15em; color: rgb(26, 6, 140)">Fireworks</a><a href="/tags/JavaScript/" style="font-size: 1.15em; color: rgb(124, 20, 36)">JavaScript</a><a href="/tags/%E7%AC%AC%E4%B8%80%E9%83%A8%E5%88%86/" style="font-size: 1.15em; color: rgb(100, 188, 188)">第一部分</a><a href="/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E7%AE%97%E6%B3%95/" style="font-size: 1.41em; color: rgb(109, 137, 18)">数据结构算法</a><a href="/tags/C/" style="font-size: 1.41em; color: rgb(83, 23, 43)">C</a><a href="/tags/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%A4%84%E7%90%86/" style="font-size: 1.15em; color: rgb(183, 174, 36)">字符串处理</a><a href="/tags/%E9%A2%98%E8%A7%A3/" style="font-size: 1.32em; color: rgb(127, 98, 115)">题解</a><a href="/tags/C/" style="font-size: 1.45em; color: rgb(39, 100, 173)">C++</a><a href="/tags/%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1/" style="font-size: 1.15em; color: rgb(107, 165, 116)">程序设计</a><a href="/tags/Studying/" style="font-size: 1.15em; color: rgb(37, 43, 154)">Studying</a><a href="/tags/%E6%95%B0%E7%BB%84/" style="font-size: 1.32em; color: rgb(56, 197, 170)">数组</a><a href="/tags/%E6%A0%A1%E5%9B%AD%E7%BD%91%E7%99%BB%E5%BD%95/" style="font-size: 1.15em; color: rgb(22, 122, 82)">校园网登录</a><a href="/tags/%E8%87%AA%E5%8A%A8%E5%8C%96%E8%84%9A%E6%9C%AC/" style="font-size: 1.15em; color: rgb(163, 0, 11)">自动化脚本</a><a href="/tags/C-C/" style="font-size: 1.36em; color: rgb(80, 169, 186)">C/C++</a><a href="/tags/%E6%9E%9A%E4%B8%BE/" style="font-size: 1.15em; color: rgb(86, 4, 128)">枚举</a><a href="/tags/%E4%BA%8C%E5%88%86/" style="font-size: 1.19em; color: rgb(29, 19, 132)">二分</a><a href="/tags/%E5%8F%8C%E6%8C%87%E9%92%88/" style="font-size: 1.15em; color: rgb(53, 9, 182)">双指针</a><a href="/tags/%E5%BD%92%E7%BA%B3%E6%80%BB%E7%BB%93/" style="font-size: 1.15em; color: rgb(165, 61, 157)">归纳总结</a><a href="/tags/%E6%8C%87%E9%92%88/" style="font-size: 1.15em; color: rgb(50, 186, 6)">指针</a><a href="/tags/KMP/" style="font-size: 1.15em; color: rgb(10, 185, 55)">KMP</a><a href="/tags/%E5%9F%BA%E7%A1%80%E7%AE%97%E6%B3%95/" style="font-size: 1.15em; color: rgb(44, 100, 133)">基础算法</a><a href="/tags/%E6%A8%A1%E6%9D%BF/" style="font-size: 1.32em; color: rgb(188, 92, 151)">模板</a><a href="/tags/%E6%90%9C%E7%B4%A2%E4%B8%8E%E5%9B%BE%E8%AE%BA/" style="font-size: 1.24em; color: rgb(67, 3, 176)">搜索与图论</a><a href="/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/" style="font-size: 1.15em; color: rgb(100, 134, 127)">数据结构</a><a href="/tags/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95/" style="font-size: 1.15em; color: rgb(186, 40, 165)">贪心算法</a><a href="/tags/%E5%89%8D%E7%BC%80%E5%92%8C/" style="font-size: 1.15em; color: rgb(174, 126, 194)">前缀和</a><a href="/tags/%E6%95%B0%E8%AE%BA/" style="font-size: 1.15em; color: rgb(185, 164, 118)">数论</a><a href="/tags/DP/" style="font-size: 1.15em; color: rgb(29, 53, 60)">DP</a><a href="/tags/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84/" style="font-size: 1.15em; color: rgb(95, 111, 31)">树状数组</a><a href="/tags/%E7%BA%BF%E6%AE%B5%E6%A0%91/" style="font-size: 1.15em; color: rgb(52, 82, 114)">线段树</a><a href="/tags/%E9%80%92%E5%BD%92/" style="font-size: 1.15em; color: rgb(137, 66, 57)">递归</a><a href="/tags/%E9%80%92%E6%8E%A8/" style="font-size: 1.15em; color: rgb(197, 112, 119)">递推</a><a href="/tags/Django/" style="font-size: 1.15em; color: rgb(125, 186, 19)">Django</a><a href="/tags/Vue/" style="font-size: 1.15em; color: rgb(66, 86, 188)">Vue</a><a href="/tags/%E5%8D%9A%E5%BC%88%E8%AE%BA/" style="font-size: 1.15em; color: rgb(6, 58, 150)">博弈论</a><a href="/tags/Game-Theory/" style="font-size: 1.15em; color: rgb(32, 189, 110)">Game Theory</a></div></div><div class="card-widget card-archives"><div class="item-headline"><i class="fas fa-archive"></i><span>归档</span><a class="card-more-btn" href="/archives/" title="查看更多">
<i class="fas fa-angle-right"></i></a></div><ul class="card-archive-list"><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2023/01/"><span class="card-archive-list-date">一月 2023</span><span class="card-archive-list-count">2</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2022/12/"><span class="card-archive-list-date">十二月 2022</span><span class="card-archive-list-count">2</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2022/06/"><span class="card-archive-list-date">六月 2022</span><span class="card-archive-list-count">1</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2022/03/"><span class="card-archive-list-date">三月 2022</span><span class="card-archive-list-count">1</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2022/01/"><span class="card-archive-list-date">一月 2022</span><span class="card-archive-list-count">3</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2021/12/"><span class="card-archive-list-date">十二月 2021</span><span class="card-archive-list-count">4</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2021/11/"><span class="card-archive-list-date">十一月 2021</span><span class="card-archive-list-count">1</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2021/10/"><span class="card-archive-list-date">十月 2021</span><span class="card-archive-list-count">7</span></a></li></ul></div><div class="card-widget card-webinfo"><div class="item-headline"><i class="fas fa-chart-line"></i><span>网站资讯</span></div><div class="webinfo"><div class="webinfo-item"><div class="item-name">文章数目 :</div><div class="item-count">42</div></div><div class="webinfo-item"><div class="item-name">本站访客数 :</div><div class="item-count" id="busuanzi_value_site_uv"></div></div><div class="webinfo-item"><div class="item-name">本站总访问量 :</div><div class="item-count" id="busuanzi_value_site_pv"></div></div><div class="webinfo-item"><div class="item-name">最后更新时间 :</div><div class="item-count" id="last-push-date" data-lastPushDate="2023-01-31T05:18:34.076Z"></div></div></div></div></div></div></main><footer id="footer"><div id="footer-wrap"><div class="copyright">©2020 - 2023 By Lin</div><div class="framework-info"><span>框架 </span><a target="_blank" rel="noopener" href="https://hexo.io">Hexo</a><span class="footer-separator">|</span><span>主题 </span><a target="_blank" rel="noopener" href="https://github.com/jerryc127/hexo-theme-butterfly">Butterfly</a></div></div></footer></div><div id="rightside"><div id="rightside-config-hide"><button id="darkmode" type="button" title="浅色和深色模式转换"><i class="fas fa-adjust"></i></button><button id="hide-aside-btn" type="button" title="单栏和双栏切换"><i class="fas fa-arrows-alt-h"></i></button></div><div id="rightside-config-show"><button id="rightside_config" type="button" title="设置"><i class="fas fa-cog fa-spin"></i></button><button id="chat_btn" type="button" title="rightside.chat_btn"><i class="fas fa-sms"></i></button><button id="go-up" type="button" title="回到顶部"><i class="fas fa-arrow-up"></i></button></div></div><div><script src="/js/utils.js"></script><script src="/js/main.js"></script><div class="js-pjax"><script>function subtitleType () {
if (true) {
var typed = new Typed("#subtitle", {
strings: "Study without desire spoils the memory, and it retains nothing that it takes in".split(","),
startDelay: 300,
typeSpeed: 150,
loop: true,
backSpeed: 50
})
} else {
document.getElementById("subtitle").innerHTML = 'Study without desire spoils the memory, and it retains nothing that it takes in'
}
}
if (true) {
if (typeof Typed === 'function') {
subtitleType()
} else {
getScript('https://cdn.jsdelivr.net/npm/typed.js/lib/typed.min.js').then(subtitleType)
}
} else {
subtitleType()
}</script></div><script defer="defer" id="ribbon" src="https://cdn.jsdelivr.net/npm/butterfly-extsrc@1/dist/canvas-ribbon.min.js" size="150" alpha="0.7" zIndex="-2" mobile="true" data-click="true"></script><script async data-pjax src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script></div></body></html>