- 博客(4)
- 问答 (2)
- 收藏
- 关注
RSS订阅原创 leetNode No154. Find Minimum in Rotated Sorted Array II
QuestionFollow up for “Find Minimum in Rotated Sorted Array”: What if duplicates are allowed?Would this affect the run-time complexity? How and why? Suppose an array sorted in ascending order is rota
2017-05-29 23:22:00
726
原创 leetcode No153. Find Minimum in Rotated Sorted Array（C++&Python）
QuestionSuppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplica
2017-05-29 22:32:46
751
原创 leetcode No25. Reverse Nodes in k-Group
QuestionGiven a linked list, reverse the nodes of a linked list k at a time and return its modified list.k is a positive integer and is less than or equal to the length of the linked list. If the numbe
2017-05-22 19:34:38
648
原创 socket中close()和shutdown()区别
基本TCP程序socket函数并发服务器Unix中编写并发服务器最简单的办法是fork一个子进程来服务每个客户。 当一个连接建立时，accept返回，服务器接着调用fork，然后由子进程服务客户（通过已连接的套接字connfd），父进程则等待另一个连接（通过监听套接字listenfd）。新的客户由子进程提供服务，父进程就关闭已连接套接字。如图： 1、服务器接收了一个客户请求 2、服务器调用
2017-05-14 11:04:58
18565
空空如也
hexo 搭建博客-hexo new出错
2017-03-16
stable_partition怎么实现的
2016-10-08
TA创建的收藏夹 TA关注的收藏夹
TA关注的人