- 博客(2)
- 收藏
- 关注
原创 662. Maximum Width of Binary Tree
Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a full binary tre
2017-08-31 00:42:21 329
原创 665. Non-decreasing Array
Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element. We define an array is non-decreasing if array[i] holds for every i (1
2017-08-30 23:50:16 267
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人