2019年7月10日
[Daily Coding Problem 223] O(1) space in order traversal of a binary tree
摘要： Typically, an implementation of in-order traversal of a binary tree has O(h) space complexity, where h is the height of the tree. Write a program to c 阅读全文
posted @ 2019-07-10 22:40 Review->Improve 阅读(733) 评论(0) 推荐(0)
[Daily Coding Problem 224] Find smallest positive integer that is not the sum of a subset of a sorted array
摘要： Given a sorted array of non-negative integers, find the smallest positive integer that is not the sum of a subset of the array. For example, for the i 阅读全文
posted @ 2019-07-10 11:43 Review->Improve 阅读(434) 评论(0) 推荐(0)