Miller1991

2016年6月23日

94. Binary Tree Inorder Traversal java solutions

摘要： Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree [1,null,2,3], return [1,3,2]. Note: Recursive so 阅读全文

posted @ 2016-06-23 10:48 Miller1991 阅读(125) 评论(0) 推荐(0) 编辑

230. Kth Smallest Element in a BST java solutions

摘要： Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ≤ k ≤ BST's 阅读全文

posted @ 2016-06-23 10:09 Miller1991 阅读(175) 评论(0) 推荐(0) 编辑

328. Odd Even Linked List java solutions

摘要： Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the 阅读全文

posted @ 2016-06-23 09:52 Miller1991 阅读(178) 评论(0) 推荐(0) 编辑

2016年6月22日

318. Maximum Product of Word Lengths java solutions

摘要： Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assum 阅读全文

posted @ 2016-06-22 18:07 Miller1991 阅读(196) 评论(0) 推荐(0) 编辑

144. Binary Tree Preorder Traversal java solutions

摘要： Given a binary tree, return the preorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [1,2,3]. Note: Recursive solu 阅读全文

posted @ 2016-06-22 17:16 Miller1991 阅读(130) 评论(0) 推荐(0) 编辑

268. Missing Number java solutions

摘要： Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example,Given nums = [0, 1, 阅读全文

posted @ 2016-06-22 16:59 Miller1991 阅读(92) 评论(0) 推荐(0) 编辑

319. Bulb Switcher java solutions

摘要： There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every 阅读全文

posted @ 2016-06-22 16:44 Miller1991 阅读(111) 评论(0) 推荐(0) 编辑

357. Count Numbers with Unique Digits java solutions

摘要： Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Example:Given n = 2, return 91. (The answer should be the 阅读全文

posted @ 2016-06-22 16:15 Miller1991 阅读(157) 评论(0) 推荐(0) 编辑

343. Integer Break java solutions

摘要： Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum pro 阅读全文

posted @ 2016-06-22 15:45 Miller1991 阅读(119) 评论(0) 推荐(0) 编辑

2016年6月21日

122. Best Time to Buy and Sell Stock II java solutions

摘要： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文

posted @ 2016-06-21 15:04 Miller1991 阅读(104) 评论(0) 推荐(0) 编辑

公告