LeetCode - 随笔分类 - andyqee

LeetCode: Gray Code

摘要：The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number... 阅读全文

posted @ 2014-09-24 15:15 andyqee 阅读(106) 评论(0) 推荐(0)

LeetCode: 4sum

摘要：Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array whic... 阅读全文

posted @ 2014-08-24 22:32 andyqee 阅读(125) 评论(0) 推荐(0)

LeetCode：3Sum Closest

摘要：Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers.... 阅读全文

posted @ 2014-08-24 18:10 andyqee 阅读(127) 评论(0) 推荐(0)

LeetCode：Remove Element

摘要：Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't mat... 阅读全文

posted @ 2014-07-05 14:50 andyqee 阅读(97) 评论(0) 推荐(0)

LeetCode: Longest Substring Without Repeating Characters

摘要：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... 阅读全文

posted @ 2014-07-03 22:24 andyqee 阅读(96) 评论(0) 推荐(0)

LeetCode：Longest Consecutive Sequence

摘要：Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given[100, 4, 200, 1, 3, 2],The longest ... 阅读全文

posted @ 2014-07-02 22:03 andyqee 阅读(114) 评论(0) 推荐(0)

LeetCode：Longest Palindromic Substring

摘要：Longest Palindromic SubstringGiven a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there... 阅读全文

posted @ 2014-06-28 21:20 andyqee 阅读(165) 评论(0) 推荐(0)

LeetCode:Palindrome Number

摘要：Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (i... 阅读全文

posted @ 2014-06-22 14:14 andyqee 阅读(150) 评论(0) 推荐(0)

LeetCode:Container With Most Water

摘要：Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ... 阅读全文

posted @ 2014-06-22 12:56 andyqee 阅读(106) 评论(0) 推荐(0)

LeetCode:Reverse Integer

摘要：Reverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321click to show spoilers.Have you thought about this?Here are som... 阅读全文

posted @ 2014-06-21 09:31 andyqee 阅读(108) 评论(0) 推荐(0)

LeetCode: Add Two Numbers

摘要：You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ... 阅读全文

posted @ 2014-06-19 23:06 andyqee 阅读(109) 评论(0) 推荐(0)

LeetCode: Palindrome Partitioning

摘要：Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, givens="aab",Return [ ["aa","b"], ["a","a","b"] ]对于这类返回所有结果集合的问题，通常都是使用DFS，递归算法Soluton:class 阅读全文

posted @ 2014-04-06 15:13 andyqee 阅读(152) 评论(0) 推荐(0)

Valid Palindrome

摘要：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama"is a palindrome."race a car"isnota palindrome.Note:Have you consider that the string might be empty? This is a good question to 阅读全文

posted @ 2014-04-04 11:05 andyqee 阅读(112) 评论(0) 推荐(0)

LeetCode： Path Sum 2

摘要：Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum = 22, 5 / \ 4 8 / / \ 11 13 4 / \ / \ 7 2 5 1return[ [5,4,11,2]... 阅读全文

posted @ 2014-03-31 21:29 andyqee 阅读(199) 评论(0) 推荐(0)

LeetCode: Path Sum

摘要：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree andsum = 22, 5 / \ 4 8 / / \ 11 13 4 / \ ... 阅读全文

posted @ 2014-03-24 22:41 andyqee 阅读(115) 评论(0) 推荐(0)

LeetCode：Convert Sorted Array to Binary Search Tree

摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST.Solution：BinaryTree* sortedArrayToBST(int arr[], int start, int end) { if (start > end) return NULL; // same as (start+end)/2, avoids overflow. int mid = start + (end - start) / 2; BinaryTree *node =. 阅读全文

posted @ 2014-03-23 17:35 andyqee 阅读(99) 评论(0) 推荐(0)

LeetCode:Convert Sorted List to Binary Search Tree

摘要：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Solution:/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; *//** * Definition for binary tre... 阅读全文

posted @ 2014-03-23 17:20 andyqee 阅读(130) 评论(0) 推荐(0)

LeetCode: Balanced Binary Tree

摘要：Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.Solution:/** * Definition for binary tree * struct TreeNode { * int val; * Tree... 阅读全文

posted @ 2014-03-23 15:14 andyqee 阅读(102) 评论(0) 推荐(0)

LeetCode: Maximum Depth of Binary Tree

摘要：Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.递归版本：class Solution {public: int maxDepth(TreeNode *root) { if(!root) return 0; // !root else return max(maxDepth(root->left... 阅读全文

posted @ 2014-03-06 22:13 andyqee 阅读(130) 评论(0) 推荐(0)

LeetCode:Merge Sorted Array

摘要：Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.class Solution {public: void ... 阅读全文

posted @ 2014-03-06 21:08 andyqee 阅读(110) 评论(0) 推荐(0)

andyqee

随笔分类 - LeetCode

公告