CY012的博客

LetT(n)T(n)=aT(bn​)+O(nd)fora>1,b>1andd>0, thenT(n)dlogb​aT(n)=O(nd)看到上面三个时间复杂度计算的前提条件，发现少了一项，就是d=0。

MaxNumberOfUsersProblem DescriptionThere is a server which has the disk space of MMM and the memory of NNN. Given some tasks, the i−thi-thi−thtask needs the disk space of XiX_iXi​ and the memory of ...

Number of IslandsProblem descriptionGiven a 2d m×nm\times nm×n grid map of '1’s (land) and '0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adj...