随笔分类 -  LeetCode

1 2 下一页
LeetCode:Climbing Stairs
摘要：You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb... 阅读全文
posted @ 2015-03-09 19:17 LeviCode 阅读(150) 评论(0) 推荐(0)
LeetCode:Search for a Range
摘要：Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文
posted @ 2014-09-21 16:51 LeviCode 阅读(103) 评论(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-09-18 13:44 LeviCode 阅读(139) 评论(0) 推荐(0)
LeetCode: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?思路：... 阅读全文
posted @ 2014-09-17 21:28 LeviCode 阅读(138) 评论(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... 阅读全文
posted @ 2014-09-17 15:26 LeviCode 阅读(102) 评论(0) 推荐(0)
LeetCode:Remove Nth Node From End of List
摘要：Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After re... 阅读全文
posted @ 2014-09-16 13:35 LeviCode 阅读(129) 评论(0) 推荐(0)
LeetCode:Swap Nodes in Pairs
摘要：Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文
posted @ 2014-09-16 11:58 LeviCode 阅读(118) 评论(0) 推荐(0)
LeetCode: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.思路：增加一个头指... 阅读全文
posted @ 2014-09-15 21:38 LeviCode 阅读(124) 评论(0) 推荐(0)
LeetCode:Maximum Subarray
摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,... 阅读全文
posted @ 2014-09-15 15:04 LeviCode 阅读(80) 评论(0) 推荐(0)
LeetCode: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? 1 /** 2 * Definition for singly-linked l... 阅读全文
posted @ 2014-09-11 21:44 LeviCode 阅读(125) 评论(0) 推荐(0)
LeetCode:Search Insert Position
摘要：Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or... 阅读全文
posted @ 2014-09-11 20:57 LeviCode 阅读(100) 评论(0) 推荐(0)
LeetCode:Roman to Integer
摘要：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999. 罗马数字有如下符号：罗马字符： I V X L C D M对应数字... 阅读全文
posted @ 2014-09-11 20:41 LeviCode 阅读(147) 评论(0) 推荐(0)
LeetCode:Best Time to Buy and Sell Stock II
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2014-07-26 17:35 LeviCode 阅读(136) 评论(0) 推荐(0)
LeetCode:Best Time to Buy and Sell Stock
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文
posted @ 2014-07-26 11:46 LeviCode 阅读(151) 评论(0) 推荐(0)
LeetCode:Reverse Integer
摘要：Reverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321 1 class Solution { 2 public: 3 int reverse(int x){ 4 ... 阅读全文
posted @ 2014-07-26 09:37 LeviCode 阅读(103) 评论(0) 推荐(0)
LeetCode:Same Tree
摘要：Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an... 阅读全文
posted @ 2014-07-21 11:49 LeviCode 阅读(118) 评论(0) 推荐(0)
LeetCode:Single Number II
摘要：Given an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a linear runtime comp... 阅读全文
posted @ 2014-07-21 11:33 LeviCode 阅读(106) 评论(0) 推荐(0)
LeetCode:Single Number
摘要：Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity... 阅读全文
posted @ 2014-07-20 18:22 LeviCode 阅读(100) 评论(0) 推荐(0)
LeetCode: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 @ 2014-07-20 16:09 LeviCode 阅读(92) 评论(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 le... 阅读全文
posted @ 2014-07-20 16:08 LeviCode 阅读(92) 评论(0) 推荐(0)

1 2 下一页