摘要:
The problem. Given a set of N distinct points in the plane, draw every (maximal) line segment that connects a subset of 4 or more of the points.Point ... 阅读全文
摘要:
问题详述:http://coursera.cs.princeton.edu/algs4/assignments/queues.htmlDequeue. A double-ended queue or deque (pronounced "deck") is a generalization of a... 阅读全文
摘要:
At first, i prepared to go through 《the introduction to algorithm》 ,however , i found some part of the book is difficult to understand; what’s more , i can’t borrow the book in the library. Then i fou... 阅读全文
摘要:
the problem is from PAT,which website is http://pat.zju.edu.cn/contests/pat-a-practise/1081 the code is as followed: #include
#include
long int gongyue(long int num1, long int num2)
{ long int gc... 阅读全文