<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Bakakyon的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Bakakyon</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Bakakyon]]></copyright><item><title><![CDATA[使用element-ui实现添加标签tag小组件]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/106650089</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/106650089</guid><author>Bakakyon</author><pubDate>Wed, 10 Jun 2020 12:53:23 +0800</pubDate><description><![CDATA[先吐个槽：
input可以获取焦点，可以自动选中，却不能自适应文本宽度；
contenteditable可以自适应文本宽度却不能调用focus()和select()！
要达到新增一个标签时选中示范文本并更改的需求还真是坎坷啊。。。
正文开始：
环境：vue-cli, element-ui
首先写一个vue模板文件：
&lt;template&gt;
	&lt;div&gt;
		&lt;template v-for="(item,index) in tags"&gt;
			&lt;div contente]]></description><category></category></item><item><title><![CDATA[从零开始刷PAT(List Grades)]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/105574216</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/105574216</guid><author>Bakakyon</author><pubDate>Fri, 17 Apr 2020 10:30:05 +0800</pubDate><description><![CDATA[题目描述
Given a list of N student records with name, ID and grade.  You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the g...]]></description><category></category></item><item><title><![CDATA[从零开始刷PAT(A+B for Polynomials)]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/105411766</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/105411766</guid><author>Bakakyon</author><pubDate>Thu, 09 Apr 2020 15:42:39 +0800</pubDate><description><![CDATA[题目描述
This time, you are supposed to find A+B where A and B are two polynomials.
输入描述
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a po...]]></description><category></category></item><item><title><![CDATA[从零开始刷PAT(Rational Sum)]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/105295995</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/105295995</guid><author>Bakakyon</author><pubDate>Fri, 03 Apr 2020 16:54:18 +0800</pubDate><description><![CDATA[题目描述
Given N rational numbers in the form numerator/denominator, you are supposed to calculate their sum.
Input Specification:
Each input file contains one test case. Each case starts with a positive ...]]></description><category></category></item><item><title><![CDATA[从零开始刷PAT(N-自守数)]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/105267856</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/105267856</guid><author>Bakakyon</author><pubDate>Thu, 02 Apr 2020 13:38:14 +0800</pubDate><description><![CDATA[题目描述
如果某个数 K 的平方乘以 N 以后，结果的末尾几位数等于 K，那么就称这个数为“N-自守数”。例如 3×92^2​​ =25392，而 25392 的末尾两位正好是 92，所以 92 是一个 3-自守数。
本题就请你编写程序判断一个给定的数字是否关于某个 N 是 N-自守数。
解题思路
这一题的关键在于判断NK2的尾数是否等于K，也就是说，我们可以利用循环取余10i（i不大于NK2的位...]]></description><category></category></item><item><title><![CDATA[从零开始刷PAT(LUCKY STRING)]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/105237834</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/105237834</guid><author>Bakakyon</author><pubDate>Wed, 01 Apr 2020 11:06:08 +0800</pubDate><description><![CDATA[题目描述
A string s is LUCKY if and only if the number of different characters in s is a fibonacci number. Given a string consisting of only lower case letters , output all its lucky non-empty substrings ...]]></description><category></category></item><item><title><![CDATA[从零开始刷PAT(福尔摩斯的约会)]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/105236185</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/105236185</guid><author>Bakakyon</author><pubDate>Wed, 01 Apr 2020 00:26:38 +0800</pubDate><description><![CDATA[题目描述：
大侦探福尔摩斯接到一张奇怪的字条：“我们约会吧！ 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&amp;hgsfdk d&amp;Hyscvnm”。大侦探很快就明白了，字条上奇怪的乱码实际上就是约会的时间“星期四 14:04”，因为前面两字符串中第1对相同的大写英文字母（大小写有区分）是第4个字母’D’，代表星期四；第2对相同的字符是’E’，那是第5个英文字...]]></description><category></category></item><item><title><![CDATA[从零开始刷PAT(数素数)]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/105235881</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/105235881</guid><author>Bakakyon</author><pubDate>Wed, 01 Apr 2020 00:04:21 +0800</pubDate><description><![CDATA[题目描述
令Pi表示第i个素数。现任给两个正整数M &lt;= N &lt;= 10000，请输出PM到PN的所有素数。
思路：
第10000个素数就是104729，数字并不大。可以利用平方根缩小遍历范围来查找，也可以采取剔除所有合数的方式，这里试试第二种。
package com.algorithm;

import java.io.BufferedReader;
import java.io....]]></description><category></category></item><item><title><![CDATA[从零开始刷PAT(数字分类)]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/105235585</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/105235585</guid><author>Bakakyon</author><pubDate>Tue, 31 Mar 2020 23:43:28 +0800</pubDate><description><![CDATA[题目描述：
给定一系列正整数，请按要求对数字进行分类，并输出以下5个数字：
A1 = 能被5整除的数字中所有偶数的和；
A2 = 将被5除后余1的数字按给出顺序进行交错求和，即计算n1-n2+n3-n4…；
A3 = 被5除后余2的数字的个数；
A4 = 被5除后余3的数字的平均数，精确到小数点后1位；
A5 = 被5除后余4的数字中最大数字。
思路：
逐条判断，A4稍微复杂点，根据输入例子9.7...]]></description><category></category></item><item><title><![CDATA[从零开始刷PAT(A+B和C)]]></title><link>https://blog.youkuaiyun.com/Bakakyon/article/details/105233176</link><guid>https://blog.youkuaiyun.com/Bakakyon/article/details/105233176</guid><author>Bakakyon</author><pubDate>Tue, 31 Mar 2020 23:30:44 +0800</pubDate><description><![CDATA[题目描述
给定区间[-2的31次方, 2的31次方]内的3个整数A、B和C，请判断A+B是否大于C。
思路
难度不高，考虑INTEGER_MIN_VALUE和INTEGER_MAX_VALUE的输入，使用BigInteger即可。
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStrea...]]></description><category></category></item></channel></rss>