<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_44776921的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_44776921</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_44776921]]></copyright><item><title><![CDATA[今天见到了一棵二叉树诶]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/100835376</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/100835376</guid><author>qq_44776921</author><pubDate>Sat, 14 Sep 2019 20:48:40 +0800</pubDate><description><![CDATA[一、二叉树的遍历【记录的位置独立于遍历过程之外，每次都需要重置记录过程】

深度优先遍历（背后有栈的影子）
1）	前序
2）	中序
3）	后序
前中后序的第一种视角：按照固定路线行进，第一次遇到，第二次遇到，第三次遇到
第二种视角（递归）：把政客二叉树分为三部分，根+左子树+右子树
①	前序，根 左子树的前序遍历 右子树的前序遍历
②	中序，左子树的中序遍历 根 右子树的中序遍历
③	后序，左子树...]]></description><category></category></item><item><title><![CDATA[集合框架及其背后数据结构1]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/100624102</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/100624102</guid><author>qq_44776921</author><pubDate>Sun, 08 Sep 2019 12:09:14 +0800</pubDate><description><![CDATA[2019年9月8日星期日
继承
Object是所有类的一个祖先类
Class A约等于class A extends object
接口
1.定义语法Interface 接口名称 【extends 其他接口】//多继承{
抽象方法列表
Viod method();//public abstract
Int a;//public static final
Static void staticMeth...]]></description><category></category></item><item><title><![CDATA[我怎么才写呢]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/100567303</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/100567303</guid><author>qq_44776921</author><pubDate>Thu, 05 Sep 2019 21:12:58 +0800</pubDate><description><![CDATA[2019年9月5日星期四

初始化顺序
1）按照书写顺序执行，定义时初始化或者构造代码块
2）统一执行构造方法
2.代码练习（继承）
3.名字的遮挡问题
1）a有歧义，优先局部变量或者形参a，再找属性中的a（本类中的属性a，父类中的属a），最后外部类中的a
2）this.a 有歧义，属性中的a(本类中的属性a,父类中的属性a)
3)super.a 没有歧义，父类的属性a
4)outer.this....]]></description><category></category></item><item><title><![CDATA[用Java实现十进制转16进制]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/96484805</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/96484805</guid><author>qq_44776921</author><pubDate>Fri, 19 Jul 2019 17:15:40 +0800</pubDate><description><![CDATA[public class Zhuan{
public static void main(String[] args)
{
System.out.println(decToHex(1958));//把1958转为16进制
//字符串翻转
public static String reverse(String s)
{
int length=s.length();
String r="";
for(i...]]></description><category></category></item><item><title><![CDATA[用Java实现对π的求解]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/96484726</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/96484726</guid><author>qq_44776921</author><pubDate>Fri, 19 Jul 2019 17:07:43 +0800</pubDate><description><![CDATA[public class Pi
{
public static void main (String[] args)
{
System.out.printf(“pi= %f%n”,calcPi(100));
}
public static double calcPi(int n)
{
double pi4=0;
for(int i=0;i&lt;n;i++)
{
int fenmu=2*i+1;
d...]]></description><category></category></item><item><title><![CDATA[用Java实现求自然对数e的值]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/96440240</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/96440240</guid><author>qq_44776921</author><pubDate>Thu, 18 Jul 2019 18:01:50 +0800</pubDate><description><![CDATA[思路：先计算阶乘，再计算分式的和
利用公式：e=1/0!+1/1!+1/2!+1/3!+…
public class Qiue{
法一：递归法求阶乘
public static long factorial1(int n){
if(n1||n0)
{return 1;}
else{return nfactorial1(n-1);}
}
法二：迭代法求阶乘
public static long fa...]]></description><category></category></item><item><title><![CDATA[用Java实现乘法口诀表]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/96318870</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/96318870</guid><author>qq_44776921</author><pubDate>Wed, 17 Jul 2019 16:03:48 +0800</pubDate><description><![CDATA[public class Chengfabiao{
public static void main(String[] args){
for(int i=1;i&lt;10;i++)
{
for(int j=1;j&lt;=i;j++){
System.out.printf("%d * %d = %d  “,i,j,i*j);
}
System.out.printf(”%n");
}
}
}

...]]></description><category></category></item><item><title><![CDATA[用Java实现汉诺塔]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/96317007</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/96317007</guid><author>qq_44776921</author><pubDate>Wed, 17 Jul 2019 15:52:06 +0800</pubDate><description><![CDATA[public class Hannuota{
public static void move (int n,int source,int dest)
{
if(n==1){
System.out.printf(“从%d移到%d%n”,source,dest);
return ;
}
int other=3-source-dest;//假设三个柱子用0,1,2来表示
move(n-1,source,...]]></description><category></category></item><item><title><![CDATA[DAY10 --------------------C语言操作符总结]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/89184118</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/89184118</guid><author>qq_44776921</author><pubDate>Wed, 10 Apr 2019 15:20:46 +0800</pubDate><description><![CDATA[一.算数操作符：+  -  *  /  %
1.%操作符的两个操作数必须是整数，返回的是整除后的余数
2.除数不能为余数
二.移位操作符:&gt;&gt;   &lt;&lt;
1.左移操作符：左边抛弃，右边补0
2.右移操作符：①无符号型：左边补0，右边丢弃
②有符号型：左边补充符号位，右边丢弃
3.-1在计算机存储时为32个1
三.位操作符:按位与&amp;  按位或|  按位异或^
1.所有...]]></description><category></category></item><item><title><![CDATA[DAY5菱形输出]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/88843536</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/88843536</guid><author>qq_44776921</author><pubDate>Wed, 27 Mar 2019 14:17:29 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
#include&lt;stdlib.h&gt;
int main()
{
int line = 0;
scanf("%d", &amp;line);//上半部分
int i = 0;//i是行数
for (i = 0; i &lt; line; i++)
{
int j = 0;
for (j = 0; j &lt; line - 1 - i; j...]]></description><category></category></item><item><title><![CDATA[起点DAY1]]></title><link>https://blog.youkuaiyun.com/qq_44776921/article/details/88562733</link><guid>https://blog.youkuaiyun.com/qq_44776921/article/details/88562733</guid><author>qq_44776921</author><pubDate>Thu, 14 Mar 2019 22:09:13 +0800</pubDate><description><![CDATA[1、初次接触优快云,希望可以在这里学到并分享很多有用的IT知识
2、一套卷子就检测出了目前水平，重复学习可以拯救遗忘
3、请永远保持好奇心和热情
4、熟能生巧，用进废退，请多动脑勤动手
5、不积跬步无以至千里，请坚持坚持再坚持
6、请相信自己可以学好，我行我能行我一定行

...]]></description><category></category></item></channel></rss>