摘要:
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,3,3,1],... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(109)
评论(0)
推荐(0)
摘要:
Given an index k, return the k th row of the Pascal's triangle.For example, given k = 3, Return[1,3,3,1].Note: Could you optimize your... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(113)
评论(0)
推荐(0)
摘要:
Given an index k, return the k th row of the Pascal's triangle.For example, given k = 3, Return[1,3,3,1].Note: Could you optimize your... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(89)
评论(0)
推荐(0)
摘要:
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down t... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(78)
评论(0)
推荐(0)
摘要:
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down t... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(87)
评论(0)
推荐(0)
摘要:
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.C++/** * Definition for a point. * ... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(140)
评论(0)
推荐(0)
摘要:
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.C++/** * Definition for a point. * ... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(121)
评论(0)
推荐(0)
摘要:
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example, Given[100, 4, 200, 1, 3... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(96)
评论(0)
推荐(0)
摘要:
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example, Given[100, 4, 200, 1, 3... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(114)
评论(0)
推荐(0)
摘要:
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,3,3,1],... 阅读全文
posted @ 2018-09-22 10:58
vercont
阅读(153)
评论(0)
推荐(0)

浙公网安备 33010602011771号