-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
60 lines (50 loc) · 17.4 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
<!DOCTYPE html><html lang="zh-Hans"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1"><meta name="description" content="雪中智代雨中杏,樱下小渚花田汐"><meta name="keywords" content=""><meta name="author" content="Twac"><meta name="copyright" content="Twac"><title>less is more. 少即是多 | Twacの自习室</title><link rel="shortcut icon" href="/melody-favicon.ico"><link rel="stylesheet" href="/css/index.css?version=1.9.1"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/font-awesome@latest/css/font-awesome.min.css?version=1.9.1"><meta name="format-detection" content="telephone=no"><meta http-equiv="x-dns-prefetch-control" content="on"><link rel="dns-prefetch" href="https://cdn.jsdelivr.net"><link rel="stylesheet" type="text/css" href="https://cdn.jsdelivr.net/npm/gitalk/dist/gitalk.min.css"><script src="https://cdn.jsdelivr.net/npm/gitalk@latest/dist/gitalk.min.js"></script><script src="https://cdn.jsdelivr.net/npm/blueimp-md5@2.10.0/js/md5.min.js"></script><meta http-equiv="Cache-Control" content="no-transform"><meta http-equiv="Cache-Control" content="no-siteapp"><script>var GLOBAL_CONFIG = {
root: '/',
algolia: undefined,
localSearch: undefined,
copy: {
success: '复制成功',
error: '复制错误',
noSupport: '浏览器不支持'
},
hexoVersion: '6.1.0'
} </script><meta name="generator" content="Hexo 6.1.0"><link rel="alternate" href="/atom.xml" title="Twacの自习室" type="application/atom+xml">
</head><body><i class="fa fa-arrow-right" id="toggle-sidebar" aria-hidden="true"></i><div id="sidebar" data-display="false"><div class="author-info"><div class="author-info__avatar text-center"><img src="https://twac-images.oss-cn-hangzhou.aliyuncs.com/blog/config/avatar.png"></div><div class="author-info__name text-center">Twac</div><div class="author-info__description text-center">雪中智代雨中杏,樱下小渚花田汐</div><div class="follow-button"><a target="_blank" rel="noopener" href="https://github.com/Twacqwq">关注我</a></div><hr><div class="author-info-articles"><a class="author-info-articles__archives article-meta" href="/archives"><span class="pull-left">文章</span><span class="pull-right">14</span></a><a class="author-info-articles__tags article-meta" href="/tags"><span class="pull-left">标签</span><span class="pull-right">6</span></a><a class="author-info-articles__categories article-meta" href="/"><span class="pull-left">分类</span><span class="pull-right">4</span></a></div><hr><div class="author-info-links"><div class="author-info-links__title text-center">Links</div><a class="author-info-links__name text-center" target="_blank" rel="noopener" href="https://blog.farmer233.top">FarmerChillax</a><a class="author-info-links__name text-center" target="_blank" rel="noopener" href="https://blog.feldan.top">Feldan</a><a class="author-info-links__name text-center" target="_blank" rel="noopener" href="https://blog.xiaotao233.top">XiaoTao</a></div></div></div><nav id="nav" style="background-image: url(https://twac-images.oss-cn-hangzhou.aliyuncs.com/blog/config/fuji.png)"><div id="page-header"><span class="pull-left"> <a id="site-name" href="/">Twacの自习室</a></span><i class="fa fa-bars toggle-menu pull-right" aria-hidden="true"></i><span class="pull-right menus"> <a class="site-page" href="/">首页</a><a class="site-page" href="/categories">分类</a><a class="site-page" href="/archives">归档</a><a class="site-page" href="/about">关于我</a></span><span class="pull-right"></span></div><div id="site-info"><div id="site-title">Twacの自习室</div><div id="site-sub-title">less is more. 少即是多</div><div id="site-social-icons"><a class="social-icon" href="https://github.com/Twacqwq" target="_blank" rel="noreferrer noopener nofollow"><i class="fa-github fa"></i></a><a class="social-icon" href="/atom.xml" target="_blank" rel="noreferrer noopener nofollow"><i class="fa-rss fa"></i></a></div></div></nav><div id="content-outer"><div class="layout" id="content-inner"><div class="recent-post-item article-container"><a class="article-title" href="/backenddev/go-kit/basicServer/">Go Kit (一) 构建最基础的HTTP服务</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-12-01</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fa fa-inbox article-meta__icon" aria-hidden="true"></i><a class="article-meta__categories" href="/backenddev/">后端学习</a></span><span class="article-meta tags"><span class="article-meta__separator">|</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/Golang/">Golang</a></span><div class="content">Go Kit 简介Go Kit 是一个用于在 Go 中构建微服务的编程工具包。与 Go Micro 不同,它被设计为一个用于导入二进制包的库。
Go Kit 遵循简单的规则,例如:
没有全局状态
声明式组合
显式依赖关系
接口即约定
领域驱动设计
在 Go Kit 中,您可以找到以下的包:
认 ...</div><a class="more" href="/backenddev/go-kit/basicServer/#more" style="margin-top: 14px">阅读更多</a><hr></div><div class="recent-post-item article-container"><a class="article-title" href="/LeetCode/leetcode/2022-11-15/">力扣小记 1710、129、515</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-11-15</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fa fa-inbox article-meta__icon" aria-hidden="true"></i><a class="article-meta__categories" href="/LeetCode/">LeetCode</a></span><span class="article-meta tags"><span class="article-meta__separator">|</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/algorithm/">算法</a></span><div class="content">1710.卡车上的最大单元数
https://leetcode.cn/problems/maximum-units-on-a-truck
思路:先对numberOfUnitsPerBoxi从大到小排序, 每次取最大的数量, 然后truckSize减去numberOfBoxesi,尽可能的装多, 当 ...</div><a class="more" href="/LeetCode/leetcode/2022-11-15/#more" style="margin-top: 14px">阅读更多</a><hr></div><div class="recent-post-item article-container"><a class="article-title" href="/LeetCode/leetcode/2022-11-14/">力扣小记 117、124、116</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-11-14</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fa fa-inbox article-meta__icon" aria-hidden="true"></i><a class="article-meta__categories" href="/LeetCode/">LeetCode</a></span><span class="article-meta tags"><span class="article-meta__separator">|</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/algorithm/">算法</a></span><div class="content">117.填充每一个节点的右侧指针Ⅱ
https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii
思路:用BFS去遍历这颗二叉树, 层序遍历框架用while控制层数, for控制层级节点
1234567891 ...</div><a class="more" href="/LeetCode/leetcode/2022-11-14/#more" style="margin-top: 14px">阅读更多</a><hr></div><div class="recent-post-item article-container"><a class="article-title" href="/LeetCode/leetcode/2022-11-13/">力扣小记 791、99、103、109、112、113</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-11-13</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fa fa-inbox article-meta__icon" aria-hidden="true"></i><a class="article-meta__categories" href="/LeetCode/">LeetCode</a></span><span class="article-meta tags"><span class="article-meta__separator">|</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/algorithm/">算法</a></span><div class="content">791.自定义字符串排序
https://leetcode.cn/problems/custom-sort-string
思路:用数组记录每个字符的位置,遍历s, 按照order的顺序自定义排序交换元素, 如果s里有order没有的元素默认位置置为0
1234567891011func custo ...</div><a class="more" href="/LeetCode/leetcode/2022-11-13/#more" style="margin-top: 14px">阅读更多</a><hr></div><div class="recent-post-item article-container"><a class="article-title" href="/LeetCode/leetcode/2022-11-12/">力扣小记 108、46、322</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-11-12</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fa fa-inbox article-meta__icon" aria-hidden="true"></i><a class="article-meta__categories" href="/LeetCode/">LeetCode</a></span><span class="article-meta tags"><span class="article-meta__separator">|</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/algorithm/">算法</a></span><div class="content">108.将有序数组转换为二叉搜索树
https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree
思路:根据题意是构造一棵平衡的BST, 对于BST的每个节点都有着root.left < root < r ...</div><a class="more" href="/LeetCode/leetcode/2022-11-12/#more" style="margin-top: 14px">阅读更多</a><hr></div><div class="recent-post-item article-container"><a class="article-title" href="/LeetCode/leetcode/2022-11-11/">力扣小记 300、354、51、53</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-11-11</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fa fa-inbox article-meta__icon" aria-hidden="true"></i><a class="article-meta__categories" href="/LeetCode/">LeetCode</a></span><span class="article-meta tags"><span class="article-meta__separator">|</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/algorithm/">算法</a></span><div class="content">突发奇想偶尔记录一两道算法题,算是记录也算是鞭策。嘛。。希望能坚持下去
300.最长递增子序列
https://leetcode.cn/problems/longest-increasing-subsequence
思路:LIS递增子序列, 定义dp数组, 第i个元素的最大递增子序列是dp[i], ...</div><a class="more" href="/LeetCode/leetcode/2022-11-11/#more" style="margin-top: 14px">阅读更多</a><hr></div><div class="recent-post-item article-container"><a class="article-title" href="/randomtoss/youth/youth_record/">保存最新一期青年大学习学习记录(广东)</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-11-05</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fa fa-inbox article-meta__icon" aria-hidden="true"></i><a class="article-meta__categories" href="/randomtoss/">瞎折腾</a></span><div class="content">保存最新一期青年大学习学习记录每周一晚上八点自动完成最新一期青年大学习并获取记录
提供自托管服务操作如下:
进入团员页点击认证资料
点击生成团员证
复制链接
提取链接中 memberId 参数的值
将 memberId 的值作为评论内容留言
一个示例(memberId=123456)
...</div><a class="more" href="/randomtoss/youth/youth_record/#more" style="margin-top: 14px">阅读更多</a><hr></div><div class="recent-post-item article-container"><a class="article-title" href="/uncategorized/XArrRss-Sonarr-Jackett-qBittorrent-Emby%E8%87%AA%E5%8A%A8%E8%BF%BD%E7%95%AA%E6%96%B9%E6%A1%88/">Sonarr+Jackett+qBittorrent+Emby自动追番方案</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-07-23</time><span class="article-meta tags"><span class="article-meta__separator">|</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/%E7%9E%8E%E6%8A%98%E8%85%BE/">瞎折腾</a></span><div class="content">众所周知B站看番环境越来越苛刻了(港澳除外),国内上线的番剧少之又少且部分番剧还有圣光剪辑和无缝链接,实属破坏看番体验。B站以外的在线看番网站画质起伏特别大,还有很多广告。所以搭建一个属于自己的影视库不仅可以满足看番需求,还可以满足BT党做种收藏需求(BT/P2P也可以XD)
Emby S ...</div><a class="more" href="/uncategorized/XArrRss-Sonarr-Jackett-qBittorrent-Emby%E8%87%AA%E5%8A%A8%E8%BF%BD%E7%95%AA%E6%96%B9%E6%A1%88/#more" style="margin-top: 14px">阅读更多</a><hr></div><div class="recent-post-item article-container"><a class="article-title" href="/randomtoss/%E7%BB%99KVM%E8%99%9A%E6%8B%9F%E6%9C%BA%E5%8A%A0%E5%8F%8C%E7%BF%85%E8%86%80/">给KVM虚拟机加双翅膀-直通独立显卡</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-06-22</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fa fa-inbox article-meta__icon" aria-hidden="true"></i><a class="article-meta__categories" href="/randomtoss/">瞎折腾</a></span><span class="article-meta tags"><span class="article-meta__separator">|</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/Linux/">Linux</a><span class="article-meta__link">-</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/KVM/">KVM</a></span><div class="content">介绍KVM(Kernel-based Virtual Machine)是一个开源的系统虚拟化模块,选择KVM的原因是因为自己的主力系统的Linux。但是出于不可抗力的原因(臭打游戏的)也不能完全脱离Winwdows,起初笔记本装了双系统,但是来回切换还是太麻烦了,虽然Linux有Wine、Proto ...</div><a class="more" href="/randomtoss/%E7%BB%99KVM%E8%99%9A%E6%8B%9F%E6%9C%BA%E5%8A%A0%E5%8F%8C%E7%BF%85%E8%86%80/#more" style="margin-top: 14px">阅读更多</a><hr></div><div class="recent-post-item article-container"><a class="article-title" href="/lanqiao/%E7%AC%AC%E5%8D%81%E4%B8%89%E5%B1%8A%E8%93%9D%E6%A1%A5%E6%9D%AF%E5%A4%8D%E7%9B%98/">第十三届蓝桥杯复盘</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2022-06-09</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fa fa-inbox article-meta__icon" aria-hidden="true"></i><a class="article-meta__categories" href="/lanqiao/">蓝桥杯</a></span><span class="article-meta tags"><span class="article-meta__separator">|</span><i class="fa fa-tag article-meta__icon" aria-hidden="true"></i><a class="article-meta__tags" href="/tags/algorithm/">算法</a></span><div class="content">参加了第十三届蓝桥杯JavaB组省赛,感觉还是很多题粗心错了。。坑坑挺多的。今年只有两道填空题,难度也稍微上来了。
试题A:星期计算问题描述:
已知今天是星期六,请问 2022 天后是星期几?注意用数字 1 到 7 表示星期一到星期日。
思路:直接求出值然后对7取余加1即可
123456789101 ...</div><a class="more" href="/lanqiao/%E7%AC%AC%E5%8D%81%E4%B8%89%E5%B1%8A%E8%93%9D%E6%A1%A5%E6%9D%AF%E5%A4%8D%E7%9B%98/#more" style="margin-top: 14px">阅读更多</a><hr></div><nav id="pagination"><div class="pagination"><span class="page-number current">1</span><a class="page-number" href="/page/2/">2</a><a class="extend next" rel="next" href="/page/2/"><i class="fa fa-chevron-right"></i></a></div></nav></div></div><footer class="footer-bg" style="background-image: url(https://twac-images.oss-cn-hangzhou.aliyuncs.com/blog/config/fuji.png)"><div class="layout" id="footer"><div class="copyright">©2019 - 2022 By Twac</div><div class="framework-info"><span>驱动 - </span><a target="_blank" rel="noopener" href="http://hexo.io"><span>Hexo</span></a><span class="footer-separator">|</span><span>主题 - </span><a target="_blank" rel="noopener" href="https://github.com/Molunerfinn/hexo-theme-melody"><span>Melody</span></a></div></div></footer><i class="fa fa-arrow-up" id="go-up" aria-hidden="true"></i><script src="https://cdn.jsdelivr.net/npm/animejs@latest/lib/anime.min.js"></script><script src="https://twac-images.oss-cn-hangzhou.aliyuncs.com/blog/config/jquery.min.js"></script><script src="https://twac-images.oss-cn-hangzhou.aliyuncs.com/blog/config/jquery.fancybox.min.js"></script><script src="https://twac-images.oss-cn-hangzhou.aliyuncs.com/blog/config/velocity.min.js"></script><script src="https://twac-images.oss-cn-hangzhou.aliyuncs.com/blog/config/velocity.ui.min.js"></script><script src="/js/utils.js?version=1.9.1"></script><script src="/js/fancybox.js?version=1.9.1"></script><script src="/js/sidebar.js?version=1.9.1"></script><script src="/js/copy.js?version=1.9.1"></script><script src="/js/fireworks.js?version=1.9.1"></script><script src="/js/transition.js?version=1.9.1"></script><script src="/js/scroll.js?version=1.9.1"></script><script src="/js/head.js?version=1.9.1"></script><script>if(/Android|webOS|iPhone|iPod|iPad|BlackBerry/i.test(navigator.userAgent)) {
$('#nav').addClass('is-mobile')
$('footer').addClass('is-mobile')
$('#top-container').addClass('is-mobile')
}</script><script src="/live2dw/lib/L2Dwidget.min.js?094cbace49a39548bed64abff5988b05"></script><script>L2Dwidget.init({"pluginRootPath":"live2dw/","pluginJsPath":"lib/","pluginModelPath":"assets/","model":{"jsonPath":"/live2dw/assets/hijiki.model.json"},"display":{"superSample":2,"width":210,"height":420,"position":"right","hOffset":0,"vOffset":-20},"mobile":{"show":false},"log":false,"tagMode":false});</script></body></html>