2015年06月_银色子弹lx

原创 Leetcode42: Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the

2015-06-30 11:08:55 412

原创 Leetcode41: Remove Duplicates from Sorted List

Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3./** * Definition for sin

2015-06-29 17:21:37 540

转载 Leetcode40: Remove Linked List Elements

Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5/** * Definition for si

2015-06-26 10:10:01 346

转载 Leetcode39: Valid Sudoku

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially fille

2015-06-26 08:54:39 371

转载 Leetcode38: Rectangle Area

Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume that the tota

2015-06-21 16:37:39 394

原创 Leetcode37: Implement strStr()

Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Update (2014-11-02):The signature of the function had been updat

2015-06-19 11:22:22 573

原创 Leetcode36: Contains Duplicate II

Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between iand j is at most

2015-06-16 11:05:24 427

原创运动历史图（MHI)——Motion History Image

MHI最初是由Bobick 和 Davis提出的，在此之前，Bobick 和 Davis 首先提出了二值的运动能量图（Motion Energy Image，MEI），通过描述物体如何移动和运动在空间中发生的位置，来进行基于运动的物体识别。运动能量图显示了运动的轮廓和能量的空间分布。在运动能量图的基础上产生了运动历史图（Motion History Image，MHI）。运动历史图是一种基于视觉的

2015-06-15 16:46:52 12103 5

转载 Leetcode35: Roman to Integer

Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.罗马数字规则：1，罗马数字共有7个，即I（1）、V（5）、X（10）、L（50）、C（100）、D（500）和M（1000）。罗马数字中没有“0”

2015-06-14 15:55:37 443

转载 Leetcode34: Compare Version Numbers

Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co

2015-06-06 20:59:16 364

LX