Flc゛
https://flc.io/icon.png
来也匆匆,去也冲冲...
2024-02-02T04:37:47.000Z
https://flc.io/
Flc
Hexo
关于 12306 售票的一些思考研究
https://flc.io/12306/
2024-02-01T07:00:12.000Z
2024-02-02T04:37:47.000Z
<blockquote>
<p>声明:本内容不一定是官方实际应用情况,仅为个人思考研究的方案。</p>
</blockquote>
<h2 id="问题:"><a href="#问题:" class="headerlink" title="问题:"></a>问题:</h2><p>买过票的都知道,乘客可以选车次的某站到某站,那意味着这期间的站点,该座位是不可售的。</p>
<p>那么,12306 是如何计算这个座位的售票情况的呢?</p>
没用的小知识:人民币复印
https://flc.io/rmb-20240123/
2024-01-23T10:28:45.000Z
2024-01-23T10:34:29.000Z
<blockquote>
<p>声明:本文仅为科普实践,不鼓励任何人进行非法活动。(保命要紧🤐🤐🤐🤐)</p>
</blockquote>
<p>黑白可复印;彩印不行,会变成黑纸。效果如图:</p>
随想:关于「及时行乐」
https://flc.io/caprice-20240110/
2024-01-10T00:46:45.000Z
2024-01-10T00:59:04.000Z
<link rel="stylesheet" class="aplayer-secondary-style-marker" href="/assets/css/APlayer.min.css"><script src="/assets/js/APlayer.min.js" class="aplayer-secondary-script-marker"></script><script class="meting-secondary-script-marker" src="/assets/js/Meting.min.js"></script><p>昨晚突然想到一个问题:</p>
<blockquote>
<p>假如我知道我只能活 1 天,我会怎么活?</p>
<p>然后我放大点:1年、10年、50年,甚至100年。</p>
</blockquote>
<p><strong>想想,结果好像都差不多,都是「及时行乐」。</strong></p>
<p><em>那我现在每天辛辛苦苦,是图个啥呢?</em>
【分享】小说【魔戒】精灵宝钻历史 全解说——青蛙刀圣
https://flc.io/share-the-silmarillion/
2023-11-28T04:24:39.000Z
2023-11-28T04:27:37.000Z
<link rel="stylesheet" class="aplayer-secondary-style-marker" href="/assets/css/APlayer.min.css"><script src="/assets/js/APlayer.min.js" class="aplayer-secondary-script-marker"></script><script class="meting-secondary-script-marker" src="/assets/js/Meting.min.js"></script><p>传送门:<a href="https://www.youtube.com/playlist?list=PLg45KLfneaCTmpGMdgmCyApV6D9hIMiuA">Youtube</a></p>
<iframe width="560" height="315" src="https://www.youtube.com/embed/videoseries?si=6sKUsn2HjsHZEkb0&list=PLg45KLfneaCTmpGMdgmCyApV6D9hIMiuA" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share"
【分享】The Go libraries that never failed us: 22 libraries you need to know
https://flc.io/share-20231113/
2023-11-13T01:20:08.000Z
2023-11-13T01:23:45.000Z
<link rel="stylesheet" class="aplayer-secondary-style-marker" href="/assets/css/APlayer.min.css"><script src="/assets/js/APlayer.min.js" class="aplayer-secondary-script-marker"></script><script class="meting-secondary-script-marker" src="/assets/js/Meting.min.js"></script><blockquote>
<p>原文地址:<a
【架构设计】Websocket 消息格式之系统事件
https://flc.io/socket-system-event/
2023-06-07T00:56:37.000Z
2023-06-07T01:30:06.000Z
<blockquote>
<p>封面来源网络,如有侵权,请联系删除。</p>
</blockquote>
<h2 id="命名规范"><a href="#命名规范" class="headerlink" title="命名规范"></a>命名规范</h2><p>系统事件的命名以 <code>socket:</code> 为前缀,例如 <code>socket:connect</code> 事件。</p>
<h2 id="事件列表"><a href="#事件列表" class="headerlink" title="事件列表"></a>事件列表</h2><h3 id="WSS-连接成功-socket-connected"><a href="#WSS-连接成功-socket-connected" class="headerlink" title="WSS 连接成功 socket:connected"></a>WSS 连接成功 <code>socket:connected</code></h3><ul>
<li><p>事件发送方:<code>服务端</code></p>
</li>
<li><p>事件信息:</p>
<figure class="highlight json"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br></pre></td><td class="code"><pre><span class="line"><span class="punctuation">{</span></span><br><span class="line"> <span class="attr">"event"</span><span class="punctuation">:</span> <span class="string">"socket:connected"</span><span class="punctuation">,</span></span><br><span class="line"> <span class="attr">"data"</span><span class="punctuation">:</span> <span class="punctuation">{</span></span><br><span class="line"> <span class="attr">"socket_id"</span><span class="punctuation">:</span> <span class="string">"1ba1b6cb-0127-48f8-b5a5-9fd79a7c68a6"</span><span class="punctuation">,</span> <span class="comment">// socket 唯一ID</span></span><br><span class="line"> <span class="attr">"heart"</span><span class="punctuation">:</span> <span class="punctuation">{</span></span><br><span class="line"> <span class="attr">"interval"</span><span class="punctuation">:</span> <span class="number">30</span><span class="punctuation">,</span> <span class="comment">// 心跳间隔,单位:秒(用户客户端发送心跳事件)</span></span><br><span class="line"> <span class="attr">"timeout"</span><span class="punctuation">:</span> <span class="number">25</span> <span class="comment">// 心跳超时,单位:秒(用于客户端接收心跳事件)</span></span><br><span class="line"> <span class="punctuation">}</span></span><br><span class="line"> <span class="punctuation">}</span></span><br><span class="line"><span class="punctuation">}</span></span><br></pre></td></tr></table></figure></li>
</ul>
2023-丽江游
https://flc.io/2023-lijiang/
2023-05-31T00:43:07.000Z
2023-06-07T00:53:56.000Z
<h2 id="行程"><a href="#行程" class="headerlink" title="行程"></a>行程</h2><ul>
<li>D1:深圳飞丽江,入住酒店,夜游丽江古城</li>
<li>D2:玉龙雪山,印象丽江,蓝月谷</li>
<li>D3:茶马古道骑马,坐车前往泸沽湖,泸沽湖划船,篝火晚会</li>
<li>D4:坐车返丽江,自由行(夜游束河古镇)</li>
<li>D5:丽江飞深圳</li>
</ul>
<blockquote>
<p>行程日期:2023-05-24 ~ 2023-05-28</p>
</blockquote>
<h2 id="相册"><a href="#相册" class="headerlink" title="相册"></a>相册</h2><h3 id="D1"><a href="#D1" class="headerlink" title="D1"></a>D1</h3><div class="justified-gallery">
<p><img src="https://s.flc.io/202305310849239.jpeg"></p>
<p><img src="https://s.flc.io/202305310850014.jpeg"></p>
<p><img src="https://s.flc.io/202305310850829.jpeg"></p>
<p><img src="https://s.flc.io/202305310850591.jpeg"></p>
<p><img src="https://s.flc.io/202305310850743.jpeg"></p>
<p><img src="https://s.flc.io/202305310851451.jpeg"></p>
<p><img src="https://s.flc.io/202305310851782.jpeg"></p>
<p><img src="https://s.flc.io/202305310852322.jpeg"></p>
<p><img src="https://s.flc.io/202305310852633.jpeg"></p>
<p><img src="https://s.flc.io/202305310853466.jpeg"></p>
<p><img src="https://s.flc.io/202305310853297.jpeg"></p>
<p><img src="https://s.flc.io/202305310854699.jpeg"></p>
<p><img src="https://s.flc.io/202305310854169.jpeg"></p>
</div>
分享:CSP 模型
https://flc.io/go-csp/
2023-05-31T00:30:29.000Z
2023-05-31T00:37:57.000Z
<blockquote>
<p>CSP 是 Communicating Sequential Process 的简称,中文直译为通信顺序进程,或者叫做交换信息的循序进程,是用来描述并发系统中进行交互的一种模式。</p>
<p>CSP 最早出现于计算机科学家 Tony Hoare 在 1978 年发表的论文中(你可能不熟悉 Tony Hoare 这个名字,但是你一定很熟悉排序算法中的 Quicksort 算法,他就是 Quicksort 算法的作者,图灵奖的获得者)。最初,论文中提出的 CSP 版本在本质上不是一种进程演算,而是一种并发编程语言,但之后又经过了一系列的改进,最终发展并精炼出 CSP 的理论。<strong>CSP 允许使用进程组件来描述系统,它们独立运行,并且只通过消息传递的方式通信。</strong></p>
<p>就像 Go 的创始人之一 Rob Pike 所说的:“每一个计算机程序员都应该读一读 Tony Hoare 1978 年的关于 CSP 的论文。”他和 Ken Thompson 在设计 Go 语言的时候也深受此论文的影响,并将 CSP 理论真正应用于语言本身(Russ Cox 专门写了一篇文章记录这个历史),通过引入 Channel 这个新的类型,来实现 CSP 的思想。</p>
<p>—— <a href="https://time.geekbang.org/column/article/304188">Go 并发编程实战课-Channel</a></p>
</blockquote>
分享:克拉克三大定律(Clarkes 三法则)
https://flc.io/clarkes-three-laws/
2023-04-13T04:41:28.000Z
2023-04-13T04:49:36.000Z
<blockquote>
<p>克拉克基本定律(英语:Clarke’s three laws)是英国著名科幻作家亚瑟·查理斯·克拉克积累有关科学文化方面的经验提出的。</p>
</blockquote>
<ul>
<li>定律一:如果一个年高德劭的杰出科学家说,某件事情是可能的,那他几乎就是正确的;但如果他说,某件事情是不可能的,那他很可能是错误的;</li>
<li>定律二:要发现某件事情是否可能的界限,唯一的途径是跨越这个界限,从可能跑到不可能中去;</li>
<li>定律三:在任何一项足够先进的技术和魔法之间,我们无法做出区分。</li>
</ul>
Golang 版的 PSR-3 Logger 规范,支持自定义 Logger
https://flc.io/go-packagist-logger/
2023-03-29T01:52:51.000Z
2023-04-13T04:49:36.000Z
<h2 id="开源地址"><a href="#开源地址" class="headerlink" title="开源地址"></a>开源地址</h2><ul>
<li><a href="https://github.com/go-packagist/logger">https://github.com/go-packagist/logger</a></li>
</ul>
<table>
<thead>
<tr>
<th><a href="https://github.com/go-packagist/logger/releases"><img src="https://badgen.net/github/release/go-packagist/logger/stable" alt="Go Version"></a></th>
<th><a href="https://pkg.go.dev/github.com/go-packagist/logger"><img src="https://pkg.go.dev/badge/github.com/go-packagist/logger" alt="GoDoc"></a></th>
<th><a href="https://codecov.io/gh/go-packagist/logger"><img src="https://codecov.io/gh/go-packagist/logger/branch/master/graph/badge.svg?token=5TWGQ9DIRU" alt="codecov"></a></th>
<th><a href="https://goreportcard.com/report/github.com/go-packagist/logger"><img src="https://goreportcard.com/badge/github.com/go-packagist/logger" alt="Go Report Card"></a></th>
<th><a href="https://github.com/go-packagist/logger/actions/workflows/go.yml"><img src="https://github.com/go-packagist/logger/actions/workflows/go.yml/badge.svg" alt="tests"></a></th>
<th><a href="https://opensource.org/licenses/MIT"><img src="https://img.shields.io/badge/license-MIT-brightgreen.svg" alt="MIT license"></a></th>
</tr>
</thead>
</table>
<blockquote>
<p><strong>说明:</strong> 设计参考 <a href="https://www.php-fig.org/psr/psr-3/">PHP PSR-3 规范</a>,做了一些调整后实现。</p>
</blockquote>
<h2 id="安装"><a href="#安装" class="headerlink" title="安装"></a>安装</h2><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">go get github.com/go-packagist/logger</span><br></pre></td></tr></table></figure>
有度 Golang 版 SDK
https://flc.io/go-youdu-sdk/
2022-07-07T00:54:58.000Z
2023-01-31T01:39:37.000Z
<h2 id="地址"><a href="#地址" class="headerlink" title="地址"></a>地址</h2><p><a href="https://github.com/go-packagist/youdu">github.com/go-packagist/youdu</a></p>
<h2 id="安装"><a href="#安装" class="headerlink" title="安装"></a>安装</h2><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">go get github.com/go-packagist/youdu</span><br></pre></td></tr></table></figure>
PHP 代码风格检测/修复工具:Laravel Pint
https://flc.io/laravel-pint/
2022-06-30T07:06:00.000Z
2023-01-31T01:39:37.000Z
<h2 id="简介"><a href="#简介" class="headerlink" title="简介"></a>简介</h2><ul>
<li>Github 地址:<a href="https://github.com/laravel/pint">https://github.com/laravel/pint</a></li>
<li>Laravel Pint 是 Laravel 官方出品,是一个专为极简主义者设计的 PHP 代码风格修复器。</li>
<li>配置兼容 <a href="https://cs.symfony.com/">php-cs-fixer</a></li>
<li>支持 Laravel 与非 Laravel 项目</li>
</ul>
通过 git subtree split 进行仓库拆分
https://flc.io/git-subtree-split/
2022-05-18T01:36:42.000Z
2023-01-17T02:27:39.000Z
<h2 id="先看效果"><a href="#先看效果" class="headerlink" title="先看效果"></a>先看效果</h2><ul>
<li><p>拆仓库前:<a href="https://github.com/laravel/framework/tree/9.x/src/Illuminate">https://github.com/laravel/framework/tree/9.x/src/Illuminate</a></p>
<p> <img src="https://s.flc.io/2022-05-18-10-20-04.png"></p>
</li>
<li><p>拆仓库后:<a href="https://github.com/illuminate">https://github.com/illuminate</a></p>
<p> <img src="https://s.flc.io/2022-05-18-10-21-09.png"></p>
</li>
</ul>
RocketMQ 安装
https://flc.io/rocketmq-install/
2022-04-14T08:49:51.000Z
2023-01-17T02:27:39.000Z
<blockquote>
<p>此处基于 Macbook Pro 的安装演示</p>
</blockquote>
<h2 id="环境依赖"><a href="#环境依赖" class="headerlink" title="环境依赖"></a>环境依赖</h2><ul>
<li>官方文档:<a href="https://rocketmq.apache.org/docs/quick-start/">https://rocketmq.apache.org/docs/quick-start/</a></li>
<li>JDK</li>
<li>Maven</li>
</ul>
<h3 id="安装-JDK"><a href="#安装-JDK" class="headerlink" title="安装 JDK"></a>安装 JDK</h3><ul>
<li><p>下载地址:<a href="https://www.oracle.com/java/technologies/downloads/#java8-mac">https://www.oracle.com/java/technologies/downloads/#java8-mac</a></p>
</li>
<li><p><img src="https://s.flc.io/2022-04-14-16-48-58.png"></p>
</li>
<li><p>配置环境变量</p>
<figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">vim ~/.bash_profile</span><br></pre></td></tr></table></figure>
<p> 输入以下内容:</p>
<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"># Java</span><br><span class="line">export JAVA_HOME="/Library/Java/JavaVirtualMachines/jdk1.8.0_321.jdk/Contents/Home"</span><br><span class="line">export PATH=$JAVA_HOME/bin:$PATH</span><br></pre></td></tr></table></figure>
<p> 生效:</p>
<figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">source</span> ~/.bash_profile</span><br></pre></td></tr></table></figure></li>
</ul>
SPM 淘宝-导购效果跟踪
https://flc.io/spm/
2022-03-18T12:58:30.000Z
2023-01-17T02:27:39.000Z
<blockquote>
<p>摘录为主</p>
</blockquote>
<h2 id="什么是-SPM"><a href="#什么是-SPM" class="headerlink" title="什么是 SPM"></a>什么是 SPM</h2><p>SPM是淘宝社区电商业务(xTao)为外部合作伙伴(外站)提供的一套跟踪引导成交效果数据的解决方案。</p>
<p>下面是一个跟踪点击到宝贝详情页的引导成交效果数据的SPM示例:</p>
<p><a href="http://detail.tmall.com/item.htm?id=3716461318&&spm=">http://detail.tmall.com/item.htm?id=3716461318&&spm=</a> <strong>2014.123456789.1.2</strong></p>
<p>其中spm=2014.123456789.1.2 便是下文所说的SPM编码</p>
<p>SPM编码:用来跟踪页面模块位置的编码,标准spm编码由4段组成,采用a.b.c.d的格式(建议 <strong>全部使用数字</strong>),其中,</p>
Hyperf:JSON-RPC 服务
https://flc.io/hyperf-jsonrpc/
2021-10-30T04:28:51.000Z
2023-01-17T02:27:39.000Z
<h2 id="Server-端"><a href="#Server-端" class="headerlink" title="Server 端"></a>Server 端</h2><h3 id="定义服务-示例)"><a href="#定义服务-示例)" class="headerlink" title="定义服务(示例)"></a>定义服务(示例)</h3><figure class="highlight php"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta"><?php</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">declare</span>(strict_types=<span class="number">1</span>);</span><br><span class="line"></span><br><span class="line"><span class="keyword">namespace</span> <span class="title class_">App</span>\<span class="title class_">JsonRpc</span>;</span><br><span class="line"></span><br><span class="line"><span class="keyword">use</span> <span class="title">Hyperf</span>\<span class="title">RpcServer</span>\<span class="title">Annotation</span>\<span class="title">RpcService</span>;</span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * 注意,如希望通过服务中心来管理服务,需在注解内增加 publishTo 属性.</span></span><br><span class="line"><span class="comment"> * <span class="doctag">@RpcService</span>(name="TestsService", protocol="jsonrpc-http", server="jsonrpc-http")</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="class"><span class="keyword">class</span> <span class="title">TestsService</span></span></span><br><span class="line"><span class="class"></span>{</span><br><span class="line"> <span class="comment">// 实现一个加法方法,这里简单的认为参数都是 int 类型</span></span><br><span class="line"> <span class="keyword">public</span> <span class="function"><span class="keyword">function</span> <span class="title">add</span>(<span class="params"><span class="keyword">int</span> <span class="variable">$a</span>, <span class="keyword">int</span> <span class="variable">$b</span></span>): <span class="title">int</span></span></span><br><span class="line"><span class="function"> </span>{</span><br><span class="line"> <span class="comment">// 这里是服务方法的具体实现</span></span><br><span class="line"> <span class="keyword">return</span> <span class="variable">$a</span> + <span class="variable">$b</span>;</span><br><span class="line"> }</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
LeetCode:链表中倒数第 k 个节点
https://flc.io/leetcode-lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/
2021-07-02T15:05:36.000Z
2023-01-17T02:27:39.000Z
<h2 id="题目"><a href="#题目" class="headerlink" title="题目"></a>题目</h2><p>输入一个链表,输出该链表中倒数第 <code>k</code> 个节点。为了符合大多数人的习惯,本题从 <code>1</code> 开始计数,即链表的尾节点是倒数第 <code>1</code> 个节点。</p>
<p>例如,一个链表有 <code>6</code> 个节点,从头节点开始,它们的值依次是 <code>1、2、3、4、5、6</code>。这个链表的倒数第 <code>3</code> 个节点是值为 <code>4</code> 的节点。</p>
LeetCode: 移动零
https://flc.io/leetcode-move-zeroes/
2021-07-01T15:11:14.000Z
2023-01-17T02:27:39.000Z
<h2 id="题目"><a href="#题目" class="headerlink" title="题目"></a>题目</h2><p>给定一个数组 <code>nums</code>,编写一个函数将所有 <code>0</code> 移动到数组的末尾,同时保持非零元素的相对顺序。</p>
<p><strong>示例:</strong></p>
<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">输入: [0,1,0,3,12]</span><br><span class="line">输出: [1,3,12,0,0]</span><br></pre></td></tr></table></figure>
LeetCode:Excel 表列名称
https://flc.io/leetcode-excel-sheet-column-title/
2021-06-30T16:08:47.000Z
2023-01-17T02:27:39.000Z
<h2 id="题目"><a href="#题目" class="headerlink" title="题目"></a>题目</h2><p>给你一个整数 <code>columnNumber</code> ,返回它在 Excel 表中相对应的列名称。</p>
<p>例如:</p>
<p>A -> 1<br>B -> 2<br>C -> 3<br>…<br>Z -> 26<br>AA -> 27<br>AB -> 28<br>…</p>
LeetCode:全排列
https://flc.io/leetcode-permutations/
2021-06-29T15:50:37.000Z
2023-01-17T02:27:39.000Z
<h2 id="题目"><a href="#题目" class="headerlink" title="题目"></a>题目</h2><p>给定一个不含重复数字的数组 <code>nums</code> ,返回其 <strong>所有可能的全排列</strong> 。你可以 <strong>按任意顺序</strong> 返回答案。</p>
<p><strong>示例 1:</strong></p>
<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">输入:nums = [1,2,3]</span><br><span class="line">输出:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]</span><br></pre></td></tr></table></figure>
LeetCode:字符串压缩
https://flc.io/leetcode-compress-string-lcci/
2021-06-28T15:02:55.000Z
2023-01-17T02:27:39.000Z
<h2 id="题目"><a href="#题目" class="headerlink" title="题目"></a>题目</h2><p>字符串压缩。利用字符重复出现的次数,编写一种方法,实现基本的字符串压缩功能。比如,字符串 <code>aabcccccaaa</code> 会变为 <code>a2b1c5a3</code>。若“压缩”后的字符串没有变短,则返回原先的字符串。你可以假设字符串中只包含大小写英文字母(a至z)。</p>
<p><strong>示例1:</strong></p>
<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">输入:"aabcccccaaa"</span><br><span class="line">输出:"a2b1c5a3"</span><br></pre></td></tr></table></figure>
LeetCode:回文排列
https://flc.io/leetcode-palindrome-permutation-lcci/
2021-06-09T15:56:32.000Z
2023-01-17T02:27:39.000Z
<h2 id="题目"><a href="#题目" class="headerlink" title="题目"></a>题目</h2><p>给定一个字符串,编写一个函数判定其是否为某个回文串的排列之一。</p>
<p>回文串是指正反两个方向都一样的单词或短语。排列是指字母的重新排列。</p>
<p>回文串不一定是字典当中的单词。</p>
<p><strong>示例1:</strong></p>
<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">输入:"tactcoa"</span><br><span class="line">输出:true(排列有"tacocat"、"atcocta",等等)</span><br></pre></td></tr></table></figure>
近况:大概就这么大
https://flc.io/da-gai-jiu-zhe-me-da/
2021-06-09T15:36:52.000Z
2023-01-17T02:55:49.000Z
<p>近期“肺痨”,咳嗽严重。</p>
<p>我立马发了个朋友圈,证明我没得新冠。</p>
LeetCode:URL化
https://flc.io/leetcode-string-to-url-lcci/
2021-06-08T13:42:45.000Z
2023-01-17T02:27:39.000Z
<h2 id="题目"><a href="#题目" class="headerlink" title="题目"></a>题目</h2><p>URL 化。编写一种方法,将字符串中的空格全部替换为 <code>%20</code> 。假定该字符串尾部有足够的空间存放新增字符,并且知道字符串的“真实”长度。(注:用Java实现的话,请使用字符数组实现,以便直接在数组上操作。)</p>
<p><strong>示例 1:</strong></p>
<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">输入:"Mr John Smith ", 13</span><br><span class="line">输出:"Mr%20John%20Smith"</span><br></pre></td></tr></table></figure>
LeetCode:判定是否互为字符重排
https://flc.io/leetcode-check-permutation-lcci/
2021-06-08T13:35:45.000Z
2023-01-17T02:27:39.000Z
<h2 id="题目"><a href="#题目" class="headerlink" title="题目"></a>题目</h2><p>给定两个字符串 <code>s1</code> 和 <code>s2</code>,请编写一个程序,确定其中一个字符串的字符重新排列后,能否变成另一个字符串。</p>
<p><strong>示例 1:</strong></p>
<figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">输入: s1 = "abc", s2 = "bca"</span><br><span class="line">输出: true </span><br></pre></td></tr></table></figure>