<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Fickleer的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Fickleer</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Fickleer]]></copyright><item><title><![CDATA[单个传递参数报错 application/json；charset=UTF-8]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/129474868</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/129474868</guid><author>Fickleer</author><pubDate>Sun, 12 Mar 2023 13:33:14 +0800</pubDate><description><![CDATA[bug记录]]></description><category></category></item><item><title><![CDATA[css:最小宽度和最小高度对span不起作用？]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/129417721</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/129417721</guid><author>Fickleer</author><pubDate>Thu, 09 Mar 2023 10:21:46 +0800</pubDate><description><![CDATA[cssbug]]></description><category></category></item><item><title><![CDATA[java demo运行环境]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/128045145</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/128045145</guid><author>Fickleer</author><pubDate>Fri, 25 Nov 2022 21:45:30 +0800</pubDate><description><![CDATA[运行demo的配置]]></description><category></category></item><item><title><![CDATA[中文参数乱码]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/125894971</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/125894971</guid><author>Fickleer</author><pubDate>Wed, 20 Jul 2022 16:25:22 +0800</pubDate><description><![CDATA[参数传递乱码问题]]></description><category></category></item><item><title><![CDATA[学习记录spring注解开发]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/123593809</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/123593809</guid><author>Fickleer</author><pubDate>Sat, 19 Mar 2022 13:55:31 +0800</pubDate><description><![CDATA[人生建议
使用spring时，先写注解再写bean。

]]></description><category></category></item><item><title><![CDATA[关于void javax.servlet.http.HttpServletResponse.setContentLengthLong(long)‘]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/123401583</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/123401583</guid><author>Fickleer</author><pubDate>Thu, 10 Mar 2022 14:52:39 +0800</pubDate><description><![CDATA[maven tomcat7的问题]]></description><category></category></item><item><title><![CDATA[java学习记录，遍历文件/文件夹内的文件。]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/117715364</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/117715364</guid><author>Fickleer</author><pubDate>Tue, 08 Jun 2021 20:24:08 +0800</pubDate><description><![CDATA[实现对给定文件夹目录结构的展示，并以文件名按升序排序的形式打印至控制台。如果是文件夹则在其名字之前加上±-，若是文件则加上–，上级目录与下级目录、下级文件用两个空格作为间隔，补充完善右侧代码区中的showDirStructure(File dir)函数实现要求的功能，
public void showDirStructure(File file)	{
        System.out.println("+--"+file.getName());
        showDirTree(file," ")]]></description><category></category></item><item><title><![CDATA[C语言，哥德巴赫猜想。]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/116131116</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/116131116</guid><author>Fickleer</author><pubDate>Sun, 25 Apr 2021 15:49:52 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
#include&lt;math.h&gt;
int main(){
	int prime(int i);
	int i,n;
	scanf("%d",&amp;n);
	for(i=3;i&lt;=n/2;i+=2){			//i++也可以  不过两个素数之间至少间隔 2  直接加 2 快一些 
		if(prime(i) &amp;&amp; prime(n-i)){
			printf("%d=%d+%d\n",n,i,n-i);
			break;
	]]></description><category></category></item><item><title><![CDATA[java输出n以内的素数。]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/116066282</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/116066282</guid><author>Fickleer</author><pubDate>Fri, 23 Apr 2021 18:20:47 +0800</pubDate><description><![CDATA[public List&lt;Integer&gt; prime(int n) {
        ArrayList arr=new ArrayList();
        int q=0;
        for(int i=2;i&lt;=n;i++){		//遍历
            for(int p=2;p&lt;=i;p++){		//枚举
                if(i%p==0){			//判断能被几个数除尽
                    q++;
      .]]></description><category></category></item><item><title><![CDATA[用1，2，3，…，9组成三位数abc,def和ghi，每个数字恰好使用一次，要求abc:def:ghi=1:2:3。输出所有的解。]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/115915696</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/115915696</guid><author>Fickleer</author><pubDate>Tue, 20 Apr 2021 18:36:38 +0800</pubDate><description><![CDATA[public static void main(String[] args){
        for(int i=100;i&lt;333;i++){	//找出等比例数
            for(int j=333;j&lt;666;j++){
                for(int h=666;h&lt;999;h++) {
                    if (2 * i == j &amp;&amp; 3 * i == h) {
                       ]]></description><category></category></item><item><title><![CDATA[汉诺塔问题]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/115352628</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/115352628</guid><author>Fickleer</author><pubDate>Wed, 31 Mar 2021 15:56:20 +0800</pubDate><description><![CDATA[void hanoi(int n,char A,char B,char C){
	if(n==1){
		printf("%c--&gt;%c   ",A,B);
		return; 
	}else{
		hanoi(n-1,A,C,B);
		printf("%c--&gt;%c   ",A,B);
		hanoi(n-1,C,B,A);
	}
}
int main(){
	int disks;
	scanf("%d",&amp;disks);				//盘子个数
	printf("\n");
	hano]]></description><category></category></item><item><title><![CDATA[C语言，鞍点问题]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/115351253</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/115351253</guid><author>Fickleer</author><pubDate>Wed, 31 Mar 2021 15:19:35 +0800</pubDate><description><![CDATA[`在这里插入代

List item

码片`@TOC
欢迎使用Markdown编辑器
你好！ 这是你第一次使用 Markdown编辑器 所展示的欢迎页。如果你想学习如何使用Markdown编辑器, 可以仔细阅读这篇文章，了解一下Markdown的基本语法知识。
新的改变
我们对Markdown编辑器进行了一些功能拓展与语法支持，除了标准的Markdown编辑器功能，我们增加了如下几点新功能，帮助你用它写博客：

全新的界面设计 ，将会带来全新的写作体验；
在创作中心设置你喜爱的代码高亮样式，Markdow]]></description><category></category></item><item><title><![CDATA[JAVA，简单的循环练习。]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/114780243</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/114780243</guid><author>Fickleer</author><pubDate>Sun, 14 Mar 2021 11:22:20 +0800</pubDate><description><![CDATA[import java.util.Scanner;
public class ForPractice4 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int sum=1000;
System.out.println(“欢迎使用中国人民银行ATM取款机”);
tc:while(true){
System.out.println(“输入取款金额：”);
int a=sc.nextInt();
if(]]></description><category></category></item><item><title><![CDATA[C语言实现求最小公倍数。]]></title><link>https://blog.youkuaiyun.com/Fickleer/article/details/114779933</link><guid>https://blog.youkuaiyun.com/Fickleer/article/details/114779933</guid><author>Fickleer</author><pubDate>Sun, 14 Mar 2021 11:15:45 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int sm(int a,int b){	//最大公因数
int f=0;
while(f=a%b){
a=b;
b=f;
}
return b;			
}
int pig (int m,int n)		//最小公倍数
{
int i=0,b=0,a=0;
b=sm(m,n);
a=m*n;
i=a/b;
return i;

}
int main()
{
int a[50];
int i,c,n;
scanf("%d",&amp;n);
for(i=0;i&]]></description><category></category></item></channel></rss>