u013935238的专栏

bezier曲线在编程中的难点在于求取曲线的系数，如果系数确定了那么就可以用微小的直线段画出曲线。bezier曲线的系数也就是bernstein系数，此系数的性质可以自行百度，我们在这里是利用bernstein系数的递推性质求取。简单举例两个点p0,p1  为一阶曲线 系数为  （1-u）p0+u*p1;  将系数存在数组中b[0] = 1-u b[1]=u三个点 p0 p1 p2

[LeetCode111]minimum-depth-of-binary-treeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.