<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[轨迹]]></title><description><![CDATA[发育中的Java攻城狮]]></description><link>https://blog.youkuaiyun.com/China_pc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; China_pc]]></copyright><item><title><![CDATA[【无标题】]]></title><link>https://blog.youkuaiyun.com/China_pc/article/details/145901668</link><guid>https://blog.youkuaiyun.com/China_pc/article/details/145901668</guid><author>China_pc</author><pubDate>Thu, 27 Feb 2025 13:21:32 +0800</pubDate><description><![CDATA[Log($"尝试 {i+1}/{MaxRetryCount} 失败: {ex.Message}", "WARN");Log($"窗口焦点已恢复至: 0x{_targetWindow.ToInt64():X8}", "DEBUG");Log($"已复制文本 (长度: {text.Length})", "INFO");Log($"正在粘贴区块 (剩余: {_textChunks.Count})", "INFO");Log($"粘贴失败: {ex.Message}", "ERROR");]]></description><category></category></item><item><title><![CDATA[爬取百度翻译]]></title><link>https://blog.youkuaiyun.com/China_pc/article/details/113832319</link><guid>https://blog.youkuaiyun.com/China_pc/article/details/113832319</guid><author>China_pc</author><pubDate>Wed, 17 Feb 2021 11:35:23 +0800</pubDate><description><![CDATA[本文主要利用Google浏览器和Pychrm来进行操作。（本操作于2021.2.18）

利用Google浏览器数据提交信息进行分析。
	
	
	
]]></description><category></category></item><item><title><![CDATA[求两个数的最大公约数]]></title><link>https://blog.youkuaiyun.com/China_pc/article/details/104100659</link><guid>https://blog.youkuaiyun.com/China_pc/article/details/104100659</guid><author>China_pc</author><pubDate>Tue, 28 Jan 2020 16:45:19 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
int main(){
	int a,b,t;
	scanf("%d%d",&amp;a,&amp;b);
	int divide(int x,int y);
	if(a&gt;b){
		divide(a,b);
	}else{
		
		t=a;
		a=b;
		b=t;
		divide(a,b);
		
	}
}
int divide(...]]></description><category></category></item><item><title><![CDATA[如何求3个整数中的最大值。]]></title><link>https://blog.youkuaiyun.com/China_pc/article/details/104060489</link><guid>https://blog.youkuaiyun.com/China_pc/article/details/104060489</guid><author>China_pc</author><pubDate>Tue, 21 Jan 2020 11:53:40 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
int main(){
	int a,b,c,m;
	printf("please input 3 numbers:");
	scanf("%d%d%d",&amp;a,&amp;b,&amp;c);
	int max(int x,int y,int z);
	m=max(a,b,c);
	printf("the biggest numbe...]]></description><category></category></item><item><title><![CDATA[Eclipse中添加Python插件]]></title><link>https://blog.youkuaiyun.com/China_pc/article/details/53992694</link><guid>https://blog.youkuaiyun.com/China_pc/article/details/53992694</guid><author>China_pc</author><pubDate>Tue, 03 Jan 2017 11:16:25 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/halfacre/archive/2012/07/22/2603848.html


安装python解释器


安装PyDev：


首先需要去Eclipse官网下载：http://www.eclipse.org/，Eclipse需要JDK支持，如果Eclipse无法正常运行，请到Java官网下载JDK安装：http://www.o]]></description><category></category></item><item><title><![CDATA[遍历HashMap的四种方法]]></title><link>https://blog.youkuaiyun.com/China_pc/article/details/53444034</link><guid>https://blog.youkuaiyun.com/China_pc/article/details/53444034</guid><author>China_pc</author><pubDate>Sat, 03 Dec 2016 13:39:39 +0800</pubDate><description><![CDATA[关于HashMap的遍历方式：public static void main(String[] args) {  
  
  
  Map map = new HashMap();  
  map.put("1", "value1");  
  map.put("2", "value2");  
  map.put("3", "value3");  
    
  //第一种：普遍使用，二次取值]]></description><category></category></item></channel></rss>