10 2015 档案

leetcode_26_ Remove Duplicates from Sorted Array (easy)
摘要：Remove Duplicates from Sorted Array题目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new ... 阅读全文
posted @ 2015-10-26 20:40 锄，禾日当午 阅读(131) 评论(0) 推荐(0)
leetcode_20_Valid Parentheses (easy)
摘要：Valid Parentheses题目：Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets... 阅读全文
posted @ 2015-10-23 10:21 锄，禾日当午 阅读(137) 评论(0) 推荐(0)
leetcode_19_Remove Nth Node From End of List (easy)
摘要：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:... 阅读全文
posted @ 2015-10-23 09:22 锄，禾日当午 阅读(133) 评论(0) 推荐(0)
leetcode_14_Longest Common Prefix (easy)
摘要：Longest Common Prefix题目：Write a function to find the longest common prefix string amongst an array of strings.找出所有字符串的最长公共前缀。解题：string&&vectorhttp://b... 阅读全文
posted @ 2015-10-22 22:02 锄，禾日当午 阅读(188) 评论(0) 推荐(0)
leetcode_13_Roman to Integer (easy)
摘要：Roman to Integer题目：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.解题： 首先我们先观察罗马数字的规律罗马数字共有七... 阅读全文
posted @ 2015-10-19 15:44 锄，禾日当午 阅读(232) 评论(0) 推荐(0)
leetcode_09_Palindrome Number (easy)
摘要：Palindrome Number题目：Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integer... 阅读全文
posted @ 2015-10-18 09:21 锄，禾日当午 阅读(166) 评论(0) 推荐(0)
Leetcode_06_ZigZag Conversion (easy)
摘要：ZigZag Conversion------(String)题目：The string"PAYPALISHIRING"is written in a zigzag pattern on a given number of rows like this: (you may want to displ... 阅读全文
posted @ 2015-10-17 11:04 锄，禾日当午 阅读(196) 评论(0) 推荐(0)
leetcode_07_Reverse Integer (easy)
摘要：题目：Reverse IntegerTotal Accepted: 102355 Total Submissions: 436373 Difficulty: Easy Reverse digits of an integer. Example1: x = 123, return 321Example... 阅读全文
posted @ 2015-10-17 11:01 锄，禾日当午 阅读(162) 评论(0) 推荐(0)