<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hillspring]]></title><description><![CDATA[征途漫漫……]]></description><link>https://blog.youkuaiyun.com/hillspring</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hillspring]]></copyright><item><title><![CDATA[常见C语言面试题之十一：约瑟夫环]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838699</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838699</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 16:02:00 +0800</pubDate><description><![CDATA[ #include "stdafx.h"#include #include typedef struct node{  int data;  struct node* next;}LNode;LNode* Create(int n, int k) //创建循环链表{  int start=k-1;  if(start==0) start = n;  LNode *s, *p, *L=NULL, *]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之十：有序表合并]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838696</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838696</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 16:01:00 +0800</pubDate><description><![CDATA[ #include "stdafx.h"#include "stdio.h"#include "stdlib.h"#include "malloc.h"typedef struct LNode{  int data;  LNode* next;}LNode, *LinkList;LinkList La, Lb, Lc;LNode* Create(){  LinkList l, p, q;  int]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之九：链表逆序]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838680</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838680</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 16:00:00 +0800</pubDate><description><![CDATA[ #include "stdafx.h"#include "stdio.h"#include "stdlib.h"typedef struct List{  int data;  struct List *next;}List;List* list_Create(void){  List *head, *tail, *p;  int e;  head = (List*)malloc(sizeof(]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之八：数组实现大数阶乘]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838666</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838666</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 15:59:00 +0800</pubDate><description><![CDATA[ #include "stdafx.h"#include using std::cout;using std::cin;using std::endl;void factorial(int x){    int re[1000],len=1,i,carry;    re[0]=1;   //初始re[0]赋值1    for(int mul=2;mul//阶乘从2开始循环        for(i]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之七：杨辉三角]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838655</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838655</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 15:58:00 +0800</pubDate><description><![CDATA[ int _tmain(int argc, _TCHAR* argv[]){    int i,j,a[10][10];     //i表示行，j表示列    for(i=0;i//首先将行列都赋值为0        for(j=0;j          a[i][j]=0;    for(i=0;i//将没一行的头尾赋值为1    {      a[i][0]=1;      a[i][i]=1]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之六：数组逆序]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838645</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838645</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 15:57:00 +0800</pubDate><description><![CDATA[#include "stdafx.h"#include "stdio.h"#include "stdlib.h"#include "string.h"void foo1(char* a){  int len = strlen(a);    for(int i=0;i  {    a[len] = a[i];    a[i] = a[len-i-1];    a[len-i-1] = a[len];]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之五：两个字符串的最大公共子字符串]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838634</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838634</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 15:56:00 +0800</pubDate><description><![CDATA[#include "stdafx.h"#include "stdio.h"#include "malloc.h"#include "string.h"char *maxsubstr(char *str1, char *str2){  char *p1, *p2, *q1, *q2, *destp;  char *substr;  int max=0, len;  p1 = str1;  while]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之四：删除字符串头尾空格，字符串右对齐]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838621</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838621</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 15:55:00 +0800</pubDate><description><![CDATA[#include "stdafx.h"#include #include #include struct st {  int id;  char ch;  char name[10];  double db;};char *rtrim(char *);char *ltrim(char *);char *rjust(char *);int _tmain(int argc, _TCHAR* argv[]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之三：字符串替代]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838612</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838612</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 15:54:00 +0800</pubDate><description><![CDATA[#include "stdafx.h"#include "string.h"#include "malloc.h"char *replace(char *source, char *sub, char *rep){  char *result;  //*pc1是复制到结果result的扫描指针  //*pc2是扫描source 的辅助指针  //*pc3寻找子串时,为检查变化中的source是否与]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之二：浮点数转换为字符串]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838601</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838601</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 15:53:00 +0800</pubDate><description><![CDATA[#include "stdafx.h"#include "stdlib.h"char *F2S(double d, char* str){  char str1[40];  int j=0,k,i;  i = (int)d;  //浮点数的整数部分  //d = d-(int)d;  while(i>0)  {    str1[j++] = i%10+0;    i /= 10;  }  fo]]></description><category></category></item><item><title><![CDATA[常见C语言面试题之一：字符串代替、字符串转换整数]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2838545</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2838545</guid><author>hillspring</author><pubDate>Wed, 27 Aug 2008 15:45:00 +0800</pubDate><description><![CDATA[#include "stdafx.h"using namespace std;//--------字符替代问题char* Translate(char* pSrc, const char cFindChar, const char* pReplaceStr, char* pTag)    {            char* p = NULL ;            int lLen = (in]]></description><category></category></item><item><title><![CDATA[泛型委托]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2754051</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2754051</guid><author>hillspring</author><pubDate>Fri, 01 Aug 2008 15:25:00 +0800</pubDate><description><![CDATA[#region Using directivesusing System;using System.Collections;using System.Collections.Generic;using System.Text;#endregionnamespace GenericMethodDemo{  public static class Algorithm  {    //1.no oper]]></description><category></category></item><item><title><![CDATA[泛型方法]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2753872</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2753872</guid><author>hillspring</author><pubDate>Fri, 01 Aug 2008 15:06:00 +0800</pubDate><description><![CDATA[using System;using System.Collections.Generic;using System.Text;using System.Collections;namespace Generic_Method{  /*  //-------第一种方案--普通方法---------  public class Account  {    private string name;  ]]></description><category></category></item><item><title><![CDATA[创建定制的泛型类--泛型Queue多线程读写文档--的泛型方法]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2752114</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2752114</guid><author>hillspring</author><pubDate>Fri, 01 Aug 2008 10:53:00 +0800</pubDate><description><![CDATA[using System;using System.Collections.Generic;using System.Text;using System.Threading;namespace Generic_T_Manager{  public interface IDocument  {    string Title    { get;}    string Content    { get]]></description><category></category></item><item><title><![CDATA[泛型LinkedList]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2746937</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2746937</guid><author>hillspring</author><pubDate>Thu, 31 Jul 2008 16:39:00 +0800</pubDate><description><![CDATA[ using System;using System.Collections.Generic;using System.Text;namespace LinkedList_T_Sample{  public class Document  {    private string title;    public string Title    {    ]]></description><category></category></item><item><title><![CDATA[泛型Queue多线程读写文档]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2743882</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2743882</guid><author>hillspring</author><pubDate>Thu, 31 Jul 2008 10:34:00 +0800</pubDate><description><![CDATA[ using System;using System.Collections.Generic;using System.Text;using System.Threading;namespace Queue_T_Sample{  public class Document  {    private string title;    public strin]]></description><category></category></item><item><title><![CDATA[泛型List]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2741316</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2741316</guid><author>hillspring</author><pubDate>Wed, 30 Jul 2008 18:05:00 +0800</pubDate><description><![CDATA[ using System;using System.Collections.Generic;using System.Text;namespace List_T_Sample{  public class Racer  {    private string name;    public string Name    {      get{retur]]></description><category></category></item><item><title><![CDATA[利用索引提高SQL Server数据处理效率]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2622198</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2622198</guid><author>hillspring</author><pubDate>Mon, 07 Jul 2008 16:58:00 +0800</pubDate><description><![CDATA[Normal07.8 磅02falsefalsefalseMicrosoftInternetExplorer4<objectclassid="clsid:38481807-CA0E-42D2-BF39-B33AF135CC4D" id=ieooui>]]></description><category></category></item><item><title><![CDATA[设计模式系列之四：装饰者模式(Decorator Pattern)]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2611529</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2611529</guid><author>hillspring</author><pubDate>Fri, 04 Jul 2008 14:40:00 +0800</pubDate><description><![CDATA[v/:* {behavior:url(#default#VML);}o/:* {behavior:url(#default#VML);}w/:* {behavior:url(#default#VML);}.shape {behavior:url(#default#VML);}Normal07.8 磅02false]]></description><category></category></item><item><title><![CDATA[设计模式系列之三：观察者模式(Observer Pattern)]]></title><link>https://blog.youkuaiyun.com/hillspring/article/details/2586053</link><guid>https://blog.youkuaiyun.com/hillspring/article/details/2586053</guid><author>hillspring</author><pubDate>Wed, 25 Jun 2008 16:44:00 +0800</pubDate><description><![CDATA[Normal07.8 磅02falsefalsefalseMicrosoftInternetExplorer4<!-- /* Font Definitions */ @font-face	{font-family:宋体;	panose-1:]]></description><category></category></item></channel></rss>