<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zcgcmx的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zcgcmx</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zcgcmx]]></copyright><item><title><![CDATA[复试阶段c语言机试代码（自用）]]></title><link>https://blog.youkuaiyun.com/zcgcmx/article/details/146134564</link><guid>https://blog.youkuaiyun.com/zcgcmx/article/details/146134564</guid><author>zcgcmx</author><pubDate>Sun, 09 Mar 2025 17:04:06 +0800</pubDate><description><![CDATA[c语言计算机机试代码，自用
]]></description><category></category></item><item><title><![CDATA[程序员代码面试指南（左程云著）java学习笔记]]></title><link>https://blog.youkuaiyun.com/zcgcmx/article/details/122550101</link><guid>https://blog.youkuaiyun.com/zcgcmx/article/details/122550101</guid><author>zcgcmx</author><pubDate>Mon, 17 Jan 2022 22:44:45 +0800</pubDate><description><![CDATA[程序员代码面试指南自我学习笔记_左程云著]]></description><category></category></item><item><title><![CDATA[一周刷爆LeetCode，左程云老师-认识O(N * logN)的排序]]></title><link>https://blog.youkuaiyun.com/zcgcmx/article/details/120853095</link><guid>https://blog.youkuaiyun.com/zcgcmx/article/details/120853095</guid><author>zcgcmx</author><pubDate>Tue, 19 Oct 2021 19:45:11 +0800</pubDate><description><![CDATA[认识O(N * logN)的排序
归并排序

1）整体就是一个简单递归，左边排好序、右边排好序、让其整体有序
2）让其整体有序的过程里用了排外序方法
3）利用master公式来求解时间复杂度
4 ）归并排序的实质
时间复杂度O(N*logN)，额外空间复杂度0(N)


package Unit2;

public class Code1_MergeSort
{
    public static void mergeSort(int []arr)
    {
        if (arr == null]]></description><category></category></item><item><title><![CDATA[一周刷爆LeetCode，左程云老师-二叉树]]></title><link>https://blog.youkuaiyun.com/zcgcmx/article/details/120753885</link><guid>https://blog.youkuaiyun.com/zcgcmx/article/details/120753885</guid><author>zcgcmx</author><pubDate>Wed, 13 Oct 2021 22:33:13 +0800</pubDate><description><![CDATA[二叉树
递归和非递归三种方式(PreOrder, InOrder, PostOrder)
递归
public static void f(Node head)
{
	if (head == null)
	{
		return;
	}
	//先序遍历
    System.out.print(head.value + " ");
	f(head.left);
	//中序遍历
    System.out.print(head.value + " ");
	f(head.right);
	//后序遍历
    ]]></description><category></category></item><item><title><![CDATA[小甲鱼零基础入门学习python笔记（老版）个人整理，持续更新ing]]></title><link>https://blog.youkuaiyun.com/zcgcmx/article/details/118885537</link><guid>https://blog.youkuaiyun.com/zcgcmx/article/details/118885537</guid><author>zcgcmx</author><pubDate>Sun, 18 Jul 2021 23:36:46 +0800</pubDate><description><![CDATA[第二章
print("--------我爱鱼c工作室--------")
temp = input("不妨猜一下小甲鱼现在心里想的是哪个数字:")
guess = int(temp)
if guess == 8:
    print("你就是小甲鱼心里的蛔虫吗？")
    print("哼,猜中了也没有奖励！")
else:
    print("猜错啦！小甲鱼现在心里想的是8")
print("游戏结束，不玩啦^_^")


BIF
built-in functions 内置函数，为的是快速编写脚本程序]]></description><category></category></item></channel></rss>