
LeetCode
yeshen4328
这个作者很懒,什么都没留下…
展开
-
LeetCode 898. Bitwise ORs of Subarrays
We have an array A of non-negative integers.For every (contiguous) subarray B = [A[i], A[i+1], ..., A[j]] (with i <= j), we take the bitwise OR of all the elements in B, obtaining a result A[i] |...原创 2018-09-09 22:43:39 · 356 阅读 · 0 评论 -
LeetCode 894. All Possible Full Binary Trees
题目描述:A full binary tree is a binary tree where each node has exactly 0 or 2 children.Return a list of all possible full binary trees with N nodes. Each element of the answer is the root node of o...原创 2018-09-12 21:48:24 · 391 阅读 · 0 评论