这个月的全部文章
@kidultff

js获取地理位置坐标

直接上代码: var show=function(position){         console.log("x="+position.coords.longitude);         console.log("y="+position.coords.latitude ...
  • 0
  • 0
@kidultff

PAT-A 真题- 1021. Deepest Root

原题干:A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called the de ...
  • 0
  • 1
@kidultff

寻找那些珍贵的回忆--网页历史记录(快照)查询

转眼间就2018年了,明天就是除夕了。想想在13年前开始接触计算机,用和楼下公用的0.5Mbps的电话线拨号上网,长城牌子的电脑,大屁股显示器,这十多年科技的发展真是快啊...突然想到能不能找回童年的回忆........遂猎奇到了一个很不错的网站,可以 ...
  • 0
  • 8
@kidultff

PAT-A 真题- 1013. Battle Over Cities

原题干:It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other ...
  • 0
  • 0
@kidultff

C语言缓冲区溢出原理与实践

我们都听说过缓冲区漏洞,那么具体原理是怎样的呢?首先我们看这个例子:#include<stdio.h> int main(){ int i=0; int a[]={1,2,3,4,5,6,7,8,9,10}; for(i=0;i<=11;i++){ printf("Hello World!\n",  ...
  • 0
  • 5