随笔分类 -  LeetCode

1 2 3 下一页
【LeetCode】136 & 137 & 260 - Single Number I & II &III
摘要：I.Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexi... 阅读全文
posted @ 2015-09-29 14:40 irun 阅读(130) 评论(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:A: a... 阅读全文
posted @ 2015-09-10 20:54 irun 阅读(168) 评论(0) 推荐(0)
【LeetCode】125 - 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: Pana... 阅读全文
posted @ 2015-09-10 20:41 irun 阅读(173) 评论(0) 推荐(0)
【LeetCode】21 - Merge Two Sorted Lists
摘要：Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Tags：Link... 阅读全文
posted @ 2015-09-10 20:02 irun 阅读(164) 评论(0) 推荐(0)
【LeetCode】205 - Isomorphic Strings
摘要：Given two stringssandt, determine if they are isomorphic.Two strings are isomorphic if the characters inscan be replaced to gett.All occurrences of a ... 阅读全文
posted @ 2015-09-09 21:36 irun 阅读(160) 评论(0) 推荐(0)
【LeetCode】20 - Valid Parentheses
摘要：Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.The brackets must close in the correct ... 阅读全文
posted @ 2015-09-09 21:05 irun 阅读(144) 评论(0) 推荐(0)
【LeetCode】1 - Two Sum
摘要：Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu... 阅读全文
posted @ 2015-09-09 20:50 irun 阅读(141) 评论(0) 推荐(0)
【LeetCode】112 - 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.Fo... 阅读全文
posted @ 2015-09-09 20:04 irun 阅读(163) 评论(0) 推荐(0)
【LeetCode】109& - Convert Sorted List to Binary Search Tree&Convert Sorted Array to Binary Search Tree
摘要：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Solution 1: recursionruntime: 28ms./** * ... 阅读全文
posted @ 2015-08-25 23:42 irun 阅读(175) 评论(0) 推荐(0)
【LeetCode】82 - Remove Duplicates from Sorted List II
摘要：Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-... 阅读全文
posted @ 2015-08-23 22:58 irun 阅读(176) 评论(0) 推荐(0)
【LeetCode】141 - Linked List Cycle
摘要：Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?Hide Tags:Linked ListTwo PointersHide Simi... 阅读全文
posted @ 2015-08-18 16:23 irun 阅读(89) 评论(0) 推荐(0)
【LeetCode】142 - Linked List Cycle II
摘要：Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?Sol... 阅读全文
posted @ 2015-08-18 16:22 irun 阅读(187) 评论(0) 推荐(0)
【LeetCode】110 - 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... 阅读全文
posted @ 2015-08-18 15:07 irun 阅读(142) 评论(0) 推荐(0)
【LeetCode】258 - Add Digits
摘要：Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ... 阅读全文
posted @ 2015-08-16 23:56 irun 阅读(326) 评论(0) 推荐(0)
【LeetCode】257 - Binary Tree Paths
摘要：Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->... 阅读全文
posted @ 2015-08-16 16:53 irun 阅读(1165) 评论(0) 推荐(0)
【LeetCode】107 - Binary Tree Level Order Traversal II
摘要：Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2015-08-16 16:21 irun 阅读(142) 评论(0) 推荐(0)
【LeetCode】102 - Binary Tree Level Order Traversal
摘要：Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文
posted @ 2015-08-16 15:51 irun 阅读(121) 评论(0) 推荐(0)
【LeetCode】104 - 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 le... 阅读全文
posted @ 2015-08-15 21:34 irun 阅读(145) 评论(0) 推荐(0)
【LeetCode】111 - Minimum Depth of Binary Tree
摘要：Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2015-08-15 20:53 irun 阅读(138) 评论(0) 推荐(0)
【LeetCode】36 - Valid Sudoku
摘要：Determine if a Sudoku is valid, according to:Sudoku Puzzles - The Rules.（http://sudoku.com.au/TheRules.aspx）The Sudoku board could be partially filled... 阅读全文
posted @ 2015-08-13 23:50 irun 阅读(214) 评论(0) 推荐(0)

1 2 3 下一页