Veritas_des_Liberty

2018年12月4日

摘要： Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive). The binary search tree is g 阅读全文

posted @ 2018-12-04 12:27 Veritas_des_Liberty 阅读(667) 评论(0) 推荐(0)

783. Minimum Distance Between BST Nodes

摘要： Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. Exa 阅读全文

posted @ 2018-12-04 11:59 Veritas_des_Liberty 阅读(261) 评论(0) 推荐(0)

2018年12月3日

732. My Calendar III (prev)

摘要： Implement a MyCalendarThree class to store your events. A new event can always be added. Your class will have one method, book(int start, int end). Fo 阅读全文

posted @ 2018-12-03 19:14 Veritas_des_Liberty 阅读(329) 评论(0) 推荐(0)

731. My Calendar II

摘要： Implement a MyCalendarTwo class to store your events. A new event can be added if adding the event will not cause a triple booking. Your class will ha 阅读全文

posted @ 2018-12-03 17:27 Veritas_des_Liberty 阅读(499) 评论(0) 推荐(0)

2018年12月2日

Weekly Contest 113

摘要： 949. Largest Time for Given Digits (string::compare) Given an array of 4 digits, return the largest 24 hour time that can be made. The smallest 24 hou 阅读全文

posted @ 2018-12-02 12:55 Veritas_des_Liberty 阅读(235) 评论(0) 推荐(0)

2018年12月1日

Segment Tree Range Minimum Query.

摘要： int rangeMinQuery(int segTree[], int qlow, int qhigh, int low, int high, int pos) { if (qlow = high) return segTree[pos]; if (qlow > high || qhigh < low) return maxVal; i... 阅读全文

posted @ 2018-12-01 22:20 Veritas_des_Liberty 阅读(239) 评论(0) 推荐(0)

699. Falling Squares

摘要： On an infinite number line (x-axis), we drop given squares in the order they are given. The i-th square dropped (positions[i] = (left, side_length)) i 阅读全文

posted @ 2018-12-01 18:15 Veritas_des_Liberty 阅读(455) 评论(0) 推荐(0)

455. Assign Cookies

摘要： Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a g 阅读全文

posted @ 2018-12-01 17:17 Veritas_des_Liberty 阅读(175) 评论(0) 推荐(0)

715. Range Module

摘要： A Range Module is a module that tracks ranges of numbers. Your task is to design and implement the following interfaces in an efficient manner. addRan 阅读全文

posted @ 2018-12-01 12:38 Veritas_des_Liberty 阅读(369) 评论(0) 推荐(0)

530. Minimum Absolute Difference in BST

摘要： Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. Example: Input: 1 \ 3 / 2 O 阅读全文

posted @ 2018-12-01 11:04 Veritas_des_Liberty 阅读(299) 评论(0) 推荐(0)

Veritas des Liberty

公告