一、拓?fù)渑判?1、hdu 1285確定比賽名次 代碼；（領(lǐng)接矩陣避免重復(fù)） #include <cstdio> #include #includ...
投稿
收錄了88篇文章 · 112人關(guān)注
算法——不用加減乘除做加法 題目描述 寫(xiě)一個(gè)函數(shù)，求兩個(gè)整數(shù)之和，要求在函數(shù)體內(nèi)不得使用+、-、*、/四則運(yùn)算符號(hào)。 思路: 利用二進(jìn)制的思想，...
Follow up for "Remove Duplicates":What if duplicates are allowed at most...
Given a m x n grid filled with non-negative numbers, find a path from to...
Given a set of distinct integers, nums, return all possible subsets (the...
Given an array with n objects colored red, white or blue, sort them so t...
Reverse a singly linked list. click to show more hints. Hint:A linked li...
Remove all elements from a linked list of integers that have value val. ...
Given an integer n, return the number of trailing zeroes in n!. Note: Yo...
Given a positive integer, return its corresponding column title as appea...
{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/272149/android.graphics.Bitmap_3190582b.jpeg', '推薦專題《ACM題庫(kù)~》（ 分享自 @簡(jiǎn)書(shū) ）','http://m.itdecent.cn/c/cc3622d64d06?utm_campaign=maleskine&utm_content=collection&utm_medium=reader_share&utm_source=weibo','頁(yè)面編碼gb2312|utf-8默認(rèn)gb2312'));){kind=link}