amazingzoe - 博客园

2016年8月7日

摘要： Given an unsorted array of integers, find the length of longest increasing subsequence. For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest inc 阅读全文

posted @ 2016-08-07 05:07 amazingzoe 阅读(162) 评论(0) 推荐(0)

Combination Sum IV

摘要： Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. 阅读全文

posted @ 2016-08-07 03:25 amazingzoe 阅读(139) 评论(0) 推荐(0)

Unique Binary Search Trees

摘要： Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example,Given n = 3, there are a total of 5 unique BST' 阅读全文

posted @ 2016-08-07 02:17 amazingzoe 阅读(152) 评论(0) 推荐(0)

Decode Ways

摘要： A message containing letters from A-Z is being encoded to numbers using the following mapping: Given an encoded message containing digits, determine t 阅读全文

posted @ 2016-08-07 01:50 amazingzoe 阅读(146) 评论(0) 推荐(0)

2016年8月6日

Wiggle Subsequence

摘要： A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The 阅读全文

posted @ 2016-08-06 10:16 amazingzoe 阅读(205) 评论(0) 推荐(0)

Rotate List

摘要： Given a list, rotate the list to the right by k places, where k is non-negative. For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3- 阅读全文

posted @ 2016-08-06 07:43 amazingzoe 阅读(112) 评论(0) 推荐(0)

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 @ 2016-08-06 04:20 amazingzoe 阅读(136) 评论(0) 推荐(0)

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. Follow up:Can you 阅读全文

posted @ 2016-08-06 03:34 amazingzoe 阅读(106) 评论(0) 推荐(0)

Wiggle Sort II

摘要： Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... Example:(1) Given nums = [1, 5, 1, 1, 6, 4], one possible 阅读全文

posted @ 2016-08-06 03:32 amazingzoe 阅读(136) 评论(0) 推荐(0)

2016年8月5日

Coin Change

摘要： You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you nee 阅读全文

posted @ 2016-08-05 05:43 amazingzoe 阅读(158) 评论(0) 推荐(0)

公告