amazingzoe - 博客园

2017年4月3日

摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You a 阅读全文

posted @ 2017-04-03 05:11 amazingzoe 阅读(130) 评论(0) 推荐(0)

2017年3月25日

Find the Duplicate Number

摘要： Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. 阅读全文

posted @ 2017-03-25 07:35 amazingzoe 阅读(123) 评论(0) 推荐(0)

2017年3月22日

Convert BST to Greater Tree

摘要： Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all 阅读全文

posted @ 2017-03-22 08:12 amazingzoe 阅读(120) 评论(0) 推荐(0)

Output Contest Matches

摘要： During the NBA playoffs, we always arrange the rather strong team to play with the rather weak team, like make the rank 1 team play with the rank nth 阅读全文

posted @ 2017-03-22 07:37 amazingzoe 阅读(253) 评论(0) 推荐(0)

Encode and Decode TinyURL

摘要： TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as http 阅读全文

posted @ 2017-03-22 07:12 amazingzoe 阅读(153) 评论(0) 推荐(0)

K-diff Pairs in an Array

摘要： Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an inte 阅读全文

posted @ 2017-03-22 06:40 amazingzoe 阅读(383) 评论(0) 推荐(0)

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 longestpath betwee 阅读全文

posted @ 2017-03-22 06:12 amazingzoe 阅读(180) 评论(0) 推荐(0)

Reverse String

摘要： 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-03-22 05:47 amazingzoe 阅读(137) 评论(0) 推荐(0)

2017年2月28日

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-02-28 20:26 amazingzoe 阅读(611) 评论(0) 推荐(0)

Detect Capital

摘要： Given a word, you need to judge whether the usage of capitals in it is right or not. We define the usage of capitals in a word to be right when one of 阅读全文

posted @ 2017-02-28 20:13 amazingzoe 阅读(136) 评论(0) 推荐(0)

公告