<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dachongzi_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dachongzi_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dachongzi_]]></copyright><item><title><![CDATA[leetcode53. 最大子数组和]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/122239412</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/122239412</guid><author>dachongzi_</author><pubDate>Thu, 30 Dec 2021 16:17:37 +0800</pubDate><description><![CDATA[给你一个整数数组 nums ，请你找出一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。
子数组 是数组中的一个连续部分。
直接copy的官网答案，因为根本不会写呀！
int maxSubArray(int nums, int numsSize){
int pre = 0, maxAns = nums[0];
for (int i = 0; i &lt; numsSize; i++) {
pre = fmax(pre + nums[i], nums[i]);
maxAns = fmax(m]]></description><category></category></item><item><title><![CDATA[LeetCode 88. 合并两个有序数组]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/122176521</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/122176521</guid><author>dachongzi_</author><pubDate>Mon, 27 Dec 2021 17:22:01 +0800</pubDate><description><![CDATA[第一次
void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n){
int i = 0,j = 0,k = 0;
while(i&lt;m &amp;&amp; j&lt; n){
if(nums1[i] &lt;= nums2[j]) nums1[k++] = nums1[i++];
else nums1[k++] = nums2[j++];
}
while(i&lt;m) nums1[k++] = num]]></description><category></category></item><item><title><![CDATA[35. 搜索插入位置]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/122169413</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/122169413</guid><author>dachongzi_</author><pubDate>Mon, 27 Dec 2021 12:47:15 +0800</pubDate><description><![CDATA[给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。
请必须使用时间复杂度为 O(log n) 的算法。
好开心，自从学编程以来第一次独立自主地解决问题并写成代码通过啦~
第一次
int searchInsert(int nums, int numsSize, int target){
int low = 0,high =  numsSize-1,mid;
while(low &lt; high){
mid = (low + high)/2]]></description><category></category></item><item><title><![CDATA[1025 PAT Ranking (25分)格式错误]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/106482163</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/106482163</guid><author>dachongzi_</author><pubDate>Mon, 01 Jun 2020 21:26:19 +0800</pubDate><description><![CDATA[a.cpp: In function ‘int main()’:
a.cpp:17:17: warning: ignoring return value of ‘int scanf(const char*, …)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &amp;n);
^
a.cpp:19:18: warning: ignoring return value of ‘int scanf(const]]></description><category></category></item><item><title><![CDATA[codeup2.5小结  习题6-6 杨辉三角]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/106389034</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/106389034</guid><author>dachongzi_</author><pubDate>Wed, 27 May 2020 19:37:49 +0800</pubDate><description><![CDATA[看别人代码写的
#include &lt;stdio.h&gt;
int main(){
int i,j;
int n;//自定义行数，可灵活输出杨辉三角
scanf("%d",&amp;n);
int a[n][n];
for(i=0;i&lt;n;i++) {
a[i][0]=1;
a[i][i]=1;
} // 最边上的所有1
for(i=2;i&lt;n;i++)
for(j=1;j&lt;i;j++) //第i行有i个数
a[i][j]=a[i-1][j-1]+a[i-1][j];//计算两个1中]]></description><category></category></item><item><title><![CDATA[关于“直播名校课程88人上清北 这不是少数人的命运游戏 ”]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/85028996</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/85028996</guid><author>dachongzi_</author><pubDate>Sun, 16 Dec 2018 11:06:40 +0800</pubDate><description><![CDATA[很久很久以前，我有一个想法，就是通过机器人把优秀地区的教学视频同步分享到落后地区的学校。没想到，这么快，也不用机器人，通过直播就把这个变成了现实。这样的做法其实就是知识资源的重复利用，就像B站上有很多资源可以反复看。作为从小地方来的学生，深深地感受到地区的差异带来的教育的落后，感受到知识资源分配的极端不平均。到了大学，很感谢B站，学到了很多东西。
希望能有更多这样的课程和学校，加油！！！

...]]></description><category></category></item><item><title><![CDATA[成]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/82857586</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/82857586</guid><author>dachongzi_</author><pubDate>Wed, 26 Sep 2018 18:51:12 +0800</pubDate><description><![CDATA[其实也没啥事儿
就是想记录一下今天好不容易哄好的几个软件
NO1.Intellij idea   洪荒之力助我成功注册
NO2.visual studio 霸占了我好几个G的c盘，哼哼，为了c 豁出去了
NO3.JDK&amp;amp;Jre 有幸搜到大仙的博客一步步安装好了，也就安装了3遍吧。。

...]]></description><category></category></item><item><title><![CDATA[关于intellij idea的]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/82854922</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/82854922</guid><author>dachongzi_</author><pubDate>Wed, 26 Sep 2018 16:10:17 +0800</pubDate><description><![CDATA[刚刚注册完intellij idea，倒腾了一两天，总算是修成半个正果了，吐血。原来只要提示
registration
your copy is licensed to SB(什么lanyu 啊，song wang 啊之类的就行了)
之前提示过，还以为没有成功，又弄了好久，蠢哭了。我的是licensed to 我的教育邮箱。耶

...]]></description><category></category></item><item><title><![CDATA[又是目录那些事儿]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/82343585</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/82343585</guid><author>dachongzi_</author><pubDate>Mon, 03 Sep 2018 08:41:02 +0800</pubDate><description><![CDATA[忍不住来发个博 
创建了目录如下 
js-&amp;gt;your-first-stylesheet.html 
css-&amp;gt;style.css 
img

要想再引用css，必须这样写

&amp;lt;link rel=&quot;stylesheet&quot; href=&quot;../css/style.css&quot;/&amp;gt;
而不能直接：
&amp;lt;link rel=&quot;stylesheet&quot; href=&quot;css/style.css.]]></description><category></category></item><item><title><![CDATA[HTML字体颜色]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/82318355</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/82318355</guid><author>dachongzi_</author><pubDate>Sun, 02 Sep 2018 19:44:32 +0800</pubDate><description><![CDATA[调整字体颜色的三种方法 
  
 
     
    My first website 
    

 
 
visit me at my website. 
visit me at my website. 
visit me at my website. 
visit me at my website.

 
]]></description><category></category></item><item><title><![CDATA[learnpythonthehardway安装pip等]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/82316478</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/82316478</guid><author>dachongzi_</author><pubDate>Sun, 02 Sep 2018 16:19:47 +0800</pubDate><description><![CDATA[下载好后 
我的pip,noes,virtualenv是用CMD安装的 
如下： 
C:\Users\lenovo&amp;gt;D:

D:\Python&amp;gt;dir pip-18.0 
 驱动器 D 中的卷是 LENOVO 
 卷的序列号是 72ED-AB3F

D:\Python\pip-18.0 的目录

2018/08/31  19:20              . 
2018/08/31 ...]]></description><category></category></item><item><title><![CDATA[web前端第7课   链接]]></title><link>https://blog.youkuaiyun.com/dachongzi_/article/details/82316392</link><guid>https://blog.youkuaiyun.com/dachongzi_/article/details/82316392</guid><author>dachongzi_</author><pubDate>Sun, 02 Sep 2018 16:12:00 +0800</pubDate><description><![CDATA[父级目录和子级目录

这是anchors.html 
 
 
     
    My first website

 


visit me at my website.



这是about.html


    
    My About Page



    About Me
    bla bla.

&amp;lt;p&amp;gt;&amp;lt;a href = &quot;../anchors.html&quot;&amp;gt...]]></description><category></category></item></channel></rss>