hellowOOOrld

2017年5月11日

[leetcode-551-Student Attendance Record I]

摘要： You are given a string representing an attendance record for a student. The record only contains the following three characters: 'A' : Absent. 'L' : L 阅读全文

posted @ 2017-05-11 11:12 hellowOOOrld 阅读(309) 评论(0) 推荐(0) 编辑

[leetcode-543-Diameter of Binary Tree]

摘要： Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path betwe 阅读全文

posted @ 2017-05-11 10:29 hellowOOOrld 阅读(121) 评论(0) 推荐(0) 编辑

2017年5月10日

[leetcode-541-Reverse String II]

摘要： Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there ar 阅读全文

posted @ 2017-05-10 22:13 hellowOOOrld 阅读(184) 评论(0) 推荐(0) 编辑

[leetcode-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 @ 2017-05-10 20:09 hellowOOOrld 阅读(166) 评论(0) 推荐(0) 编辑

[leetcode-521-Longest Uncommon Subsequence I]

摘要： Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defi 阅读全文

posted @ 2017-05-10 19:16 hellowOOOrld 阅读(428) 评论(0) 推荐(0) 编辑

[leetcode-504-Base 7]

摘要： Given an integer, return its base 7 string representation. Example 1: Input: 100 Output: "202" Example 2: Input: -7 Output: "-10" Note: The input will 阅读全文

posted @ 2017-05-10 17:01 hellowOOOrld 阅读(118) 评论(0) 推荐(0) 编辑

2017年5月7日

[leetcode-116-Populating Next Right Pointers in Each Node]

摘要： Given a binary tree Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL 阅读全文

posted @ 2017-05-07 19:25 hellowOOOrld 阅读(164) 评论(0) 推荐(0) 编辑

[leetcode-573-Squirrel Simulation]

摘要： There's a tree, a squirrel, and several nuts. Positions are represented by the cells in a 2D grid. Your goal is to find the minimal distance for the s 阅读全文

posted @ 2017-05-07 12:13 hellowOOOrld 阅读(297) 评论(0) 推荐(0) 编辑

[leetcode-572-Subtree of Another Tree]

摘要： Given two non-empty binary trees s and t, check whether tree t hasexactly the same structure and node values with a subtree of s.A subtree of s is a t 阅读全文

posted @ 2017-05-07 11:15 hellowOOOrld 阅读(188) 评论(0) 推荐(0) 编辑

[leetcode-575-Distribute Candies]

摘要： Given an integer array with even length, where different numbers in this array represent different kinds of candies.Each number means one candy of the 阅读全文

posted @ 2017-05-07 11:11 hellowOOOrld 阅读(273) 评论(0) 推荐(0) 编辑

hello world~

公告