2017年11月
[Leetcode]442. Find All Duplicates in an Array
摘要： Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements that appear twi 阅读全文
posted @ 2017-11-28 16:26 SkyMelody 阅读(117) 评论(0) 推荐(0)
[Leetcode]643. Maximum Average Subarray I
摘要： Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the 阅读全文
posted @ 2017-11-21 17:37 SkyMelody 阅读(118) 评论(0) 推荐(0)
[Leetcode]724. Find Pivot Index
摘要： Given an array of integers nums, write a method that returns the "pivot" index of this array. We define the pivot index as the index where the sum of 阅读全文
posted @ 2017-11-20 22:26 SkyMelody 阅读(99) 评论(0) 推荐(0)
[Leetcode]86. Partition List
摘要： Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the 阅读全文
posted @ 2017-11-08 18:50 SkyMelody 阅读(95) 评论(0) 推荐(0)
[Leetcode]109. Convert Sorted List to Binary Search Tree
摘要： Given a singly linked list where elements are sorted in ascending order, convert it to a heightbalanced BST. 思路：二分法； 阅读全文
posted @ 2017-11-05 14:05 SkyMelody 阅读(103) 评论(0) 推荐(0)
[Leetcode]617. Merge Two Binary Trees
摘要： Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n 阅读全文
posted @ 2017-11-05 09:43 SkyMelody 阅读(87) 评论(0) 推荐(0)
[Leetcode]450. Delete Node in a BST
摘要： Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of th 阅读全文
posted @ 2017-11-05 09:29 SkyMelody 阅读(102) 评论(0) 推荐(0)
[Leetcode]101. Symmetric Tree
摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2017-11-04 15:22 SkyMelody 阅读(83) 评论(0) 推荐(0)
[Leetcode]160. Intersection of Two Linked Lists
摘要： Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: begin to in 阅读全文
posted @ 2017-11-03 15:41 SkyMelody 阅读(99) 评论(0) 推荐(0)
[Leetcode]142. Linked List Cycle II
摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. 思路：我的想法是先用快慢指针判断是 阅读全文
posted @ 2017-11-03 15:07 SkyMelody 阅读(110) 评论(0) 推荐(0)