<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Jameswwd的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Jameswwd</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Jameswwd]]></copyright><item><title><![CDATA[POJ3624手链]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/68182613</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/68182613</guid><author>Jameswwd</author><pubDate>Wed, 29 Mar 2017 22:10:42 +0800</pubDate><description><![CDATA[POJ3624 Description


Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available cha]]></description><category></category></item><item><title><![CDATA[poj2017Speed Limit]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/62991343</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/62991343</guid><author>Jameswwd</author><pubDate>Fri, 17 Mar 2017 23:47:30 +0800</pubDate><description><![CDATA[题目链接http://poj.org/problem?id=2017]]></description><category></category></item><item><title><![CDATA[ACMpoj 1953斐波拉契数列]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/62976855</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/62976855</guid><author>Jameswwd</author><pubDate>Fri, 17 Mar 2017 23:33:44 +0800</pubDate><description><![CDATA[题目链接http://poj.org/problem?id=1953
给定一个正整数，确定确定数量的n位序列，不包含相邻1  


f[0]=0;
f[1]=2;    0 1
f[2]=3;    00 01 10f[3]=5;    000, 001, 010, 100, 101i>3,f[i]=f[i-1]+f[i-2]]]></description><category></category></item><item><title><![CDATA[poj2479最大数的和]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/62965177</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/62965177</guid><author>Jameswwd</author><pubDate>Fri, 17 Mar 2017 23:13:42 +0800</pubDate><description><![CDATA[题目链接http://poj.org/problem?id=2479

 在一组数中，找到连续的两段 ， 让两段相加和达到最大
dp[0][i]表示取到第i个数时只取了一段的最大和

dp[1][i]表示取到第i个数时取了2段的最大和

dp[0][i] = max{dp[0][i-1]+a[i] , a[i]}

dp[1][i] = max{dp[0][j]+a[i] , d]]></description><category></category></item><item><title><![CDATA[如何卸载删除sql2005]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/62888257</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/62888257</guid><author>Jameswwd</author><pubDate>Fri, 17 Mar 2017 15:00:13 +0800</pubDate><description><![CDATA[WIN7彻底删除sql2005的步骤如下(有点坑做实验卸载不干净重装系统后再装SQL2005都装不上)：
1：首先进入控制面板，卸载带有SQL Server字样的所有程序,具体列表如下：
Microsoft SQL Server VSS Writer
Microsoft SQL Server Setup Support Files(English)
Microsoft SQL Server]]></description><category></category></item><item><title><![CDATA[扩大C盘]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/53832430</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/53832430</guid><author>Jameswwd</author><pubDate>Fri, 23 Dec 2016 02:26:59 +0800</pubDate><description><![CDATA[一个小技巧之扩大C盘/
我的C盘无法扩容软件也没放里面还是小/
C盘目录有2个系统隐藏文件虚拟内存pagefile.sys（可移动）和休眠hiberfil.sys（可关闭）占用了十几G！
powercfg/off回车关闭休眠
powercfg/a回车查看休眠睡眠状态
powercfg/on打开休眠
从19G到了33.6G



cacls "F:System Volume In]]></description><category></category></item><item><title><![CDATA[Eclipse 制作API文档]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/53817012</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/53817012</guid><author>Jameswwd</author><pubDate>Thu, 22 Dec 2016 16:58:32 +0800</pubDate><description><![CDATA[eclipse 制作API文档
1.选择工程，在菜单Project->Genarate Javadoc 
2.选择工程，鼠标右键菜单Export ，选择Java 下面的Javadoc ，点”next” 按钮 
3.选择工程，在菜单File->Export ，选择Java 下面的Javadoc ，点”next” 按钮 
然后，可以选择生成到Javadoc 文档中的内容( 一般选public ]]></description><category></category></item><item><title><![CDATA[I/O流之分析成绩单]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/53529200</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/53529200</guid><author>Jameswwd</author><pubDate>Fri, 09 Dec 2016 01:14:41 +0800</pubDate><description><![CDATA[姓名:张三，数学72分，物理67分，英语70分.
姓名:李四，数学92分，物理98分，英语88分.
姓名:周五，数学68分，物理80分，英语77分.
把以上成绩单按行读入，输出总成绩，平均分，最高分，写入到socreAnalysis.txt文件中
import java.io.*;
import java.util.*;
public class AnalysisResult {
    pu]]></description><category></category></item><item><title><![CDATA[重识JAVA万物皆对象]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/53446027</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/53446027</guid><author>Jameswwd</author><pubDate>Sat, 03 Dec 2016 17:06:53 +0800</pubDate><description><![CDATA[对象引用类与现实世界
从创建一个对象开始
创建对象的过程
特例基本数据类型
又一个特例 String
值传递和引用传递的战争
对象的强引用软引用弱引用和虚引用
对象的复制

深复制和浅复制


（来源http://blog.c  sdn.net/qq_31655965）



如果你现实中没有对象，至少你在Java世界里会有茫茫多的对象，听起来是不是很激动呢？]]></description><category></category></item><item><title><![CDATA[IDEA入门级]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/53445591</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/53445591</guid><author>Jameswwd</author><pubDate>Sat, 03 Dec 2016 16:33:30 +0800</pubDate><description><![CDATA[最智能的IDE




智能提示重构代码

更友好的代码提示功能

什么叫智能

强大的纠错能力




IDEA的基础配置




jdk的配置

tomcat的配置




IDEA创建一个structs项目



IDEA的个人配置与常用操作




IDEA的个人配置

IDEA的常用操作


来源：htt]]></description><category></category></item><item><title><![CDATA[打印n阶杨辉3角（之数据溢出）]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/53401943</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/53401943</guid><author>Jameswwd</author><pubDate>Tue, 29 Nov 2016 23:16:53 +0800</pubDate><description><![CDATA[溢出：在用程序数据类型时，往往会出现当n取大时，数据的精度会和结果想要的不一致，需要选取合适的数据类型
比如求8+88+888+8888+......前12项的和n=12;结果为209876543199
public class 李小龙 {
public static void main (String args[]){
long s=0,a=8,item=a,n=100,i=1;
fo]]></description><category></category></item><item><title><![CDATA[高斯消元法求线性方程组]]></title><link>https://blog.youkuaiyun.com/Jameswwd/article/details/53400493</link><guid>https://blog.youkuaiyun.com/Jameswwd/article/details/53400493</guid><author>Jameswwd</author><pubDate>Tue, 29 Nov 2016 21:44:50 +0800</pubDate><description><![CDATA[#include
#include
void main(){
   FILE *f;
   double a[20][20],b[20],x[20];
   double s,m;
    int i,j,k,n;
   f=fopen("D:\\实验3高斯数据.txt","r");
   fscanf(f,"%d",&n);
   for(i=1;i
   for(j=1;j]]></description><category></category></item></channel></rss>