Given a non-negative number represented as an array of digits, plus one ...
投稿
收錄了2篇文章 · 3人關(guān)注
Given a non-negative number represented as an array of digits, plus one ...
問題很簡單，兩個無環(huán)的單鏈表有個交點，找到這個點。不過題目要求不能用額外的空間O(1)，并且是線型時間O(n)。 Write a program...
{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1881139527',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://upload.jianshu.io/collections/images/228442/no-pic.jpg', '推薦專題《別人家孩子的代碼》（ 分享自 @簡書 ）','http://www.itdecent.cn/c/aa0147bc3666?utm_campaign=maleskine&utm_content=collection&utm_medium=reader_share&utm_source=weibo','頁面編碼gb2312|utf-8默認gb2312'));){kind=link}