摘要:
#include#includetypedef struct _ListNode{ int m_nKey; struct _ListNode *m_pNext;}ListNode;//插入节点void InsertNode(ListNode **plistHead, int val){ ListNo... 阅读全文
摘要:
#include#include#include#define MAXINT 0x7fffffff#define MININT 0X80000000//字符串中第一个只出现一次的字符char firstSingle(char *str){ int a[255]; memset(a, 0, 255 *... 阅读全文
摘要:
/* fi表示第i行的最左最小元素的列小标,则有f0#includeusing namespace std;void findOddMin(vector> &a, int m, int n, vector &r){ int len = r.size(); vector tmp; for (int i... 阅读全文
摘要:
#include#include#include#include#define MAXINT (1= 0 && a[j]>tmp){ a[j + 1] = a[j]; --j; } a[j + 1] = tmp; }}void merge(int *a, int p, int q, in... 阅读全文
摘要:
#include#include#includevoid swap(int *a, int i, int j){ int tmp = a[i]; a[i] = a[j]; a[j] = tmp;}void BubbleSort(int *a, int n){ for (int... 阅读全文
摘要:
#include#include#includeusing namespace std;void swap(int *a, int i, int j){ int tmp = a[i]; a[i] = a[j]; a[j] = tmp;}int partition(int *a, i... 阅读全文
摘要:
#include#include#include#define leftChild(i) (2*(i)+1)//交换void swap(int *a, int i, int j){ int tmp = a[i]; a[i] = a[j]; a[j] = tmp;}//堆下溯void... 阅读全文
摘要:
#includeint fcntl(fd,F_GETLK/F_SETLK/F_SETLKW,struct flock *flockptr);F_GETLK:测试flockptr描述的锁,是否和现有锁冲突。冲突:现有锁写入flockptr中;不冲突:flockptr不变。F_SETLK:试图获得读锁、... 阅读全文
摘要:
设置描述符非阻塞的两种方法:1,调用 open 时,设置,O_NONBLOCK;2,调用 fcntl设置;具体如下:1,open("/xxx/file1",O_RDWR|O_NONBLOCK);2,val=fcntl(fd,F_GETFL,0); F_GETFL获取文件状态标识 val |... 阅读全文
摘要:
参考:http://www.cnblogs.com/Anker/p/3265058.htmlselect /* According to POSIX.1-2001 */ #include /* According to earlier standards */ ... 阅读全文