随笔- 65 文章- 1 评论- 1 阅读- 52390

12 2019 档案

摘要：1.形如 T(n) = a * T(n/b) + f(n) 的时间复杂度计算方法有一种方法叫做主方法（Master method）是用来专门计算这种形式的时间复杂度的，方法具体如下：下边举例进行说明：例1： T(n) = 25*T(n/5) + n^2 因为：a=25,b=5,d=2,f(n) 阅读全文

posted @ 2019-12-22 16:41 强威阅读(2860) 评论(0) 推荐(0) 编辑

62. Unique Paths

摘要：A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

posted @ 2019-12-05 20:22 强威阅读(271) 评论(0) 推荐(0) 编辑

54. Spiral Matrix && 59. Spiral Matrix II

摘要：Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. Example: Given a matrix of m x n elements (m r 阅读全文

posted @ 2019-12-04 21:35 强威阅读(233) 评论(0) 推荐(0) 编辑

57. Insert Interval

摘要：Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initia 阅读全文

posted @ 2019-12-04 21:30 强威阅读(255) 评论(0) 推荐(0) 编辑