- 博客(8)
- 资源 (5)
- 问答 (2)
- 收藏
- 关注
RSS订阅原创 Win32实现简单的TCP连接
服务器端 #include #include void main(){ WORD wVersionRequested; WSADATA wsaData; int err; wVersionRequested=MAKEWORD(1,1); err = WSAStartup(wVersionRequested,&wsaData); if(err!=0){ return; } if(LOBYTE(w
2014-11-26 19:32:13
1476
原创 MFC实现鼠标跟踪画直线
#include class CMyApp:public CWinApp{ public: virtual BOOL InitInstance(); }; class CMainWindow:public CFrameWnd{ protected: BOOL m_bTracking; BOOL m_bCaptureEnabled; CPoint m_ptFrom; CPoint m_p
2014-11-25 15:14:37
1487
原创 C++链表插入排序
#include using namespace std; struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; ListNode *insertionSortList(ListNode *head) { if(head==N
2014-11-14 15:21:13
785
1
原创 C++随机选择算法
#include #include #include #include using namespace std; int partition (int A[],int p,int r){ int x=A[r]; int i=p-1; for(int j=p;j<r;j++){ if(A[j]<=x){ i++; swap(A[i],A[j]); } } swap
2014-11-07 15:16:33
1668
原创 leetcode Reverse Words in a String
Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". click to show clarification. Clarification: What constitutes
2014-11-05 20:24:43
964
原创 C++桶排序
#include #include using namespace std; class A{ public: int length; vector a; }; void insertSort(vector &b){ int size = b.size(); int key,i; for(int j=1;j<size;j++){ key=b[j]; i=j-1; while(i>
2014-11-04 16:57:57
421
原创 C++创建最大堆
#include #include #include using namespace std; class Heap{ public: int heap_size; vector heap; void maxHeap(vector&heap,int i); void buildMaxHeap(vector&heap); }; void Heap::maxHeap(vector&heap,i
2014-11-04 12:30:12
1027
spring-data-elasticsearch api 离线文档
2017-09-08
重构_改善既有代码的设计_完美书签版
2017-04-15
我的hihocoder这个最长回文子串为什么报wrong answer?
2016-01-29
我这个netty5 TimeServer为什么达不到效果？
2016-01-27
TA创建的收藏夹 TA关注的收藏夹
TA关注的人