c-c++
文章平均质量分 53
葱shen
爱技术,爱学习,爱游戏~
展开
-
[leetcode] 【位运算】 371. Sum of Two Integers
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example:Given a = 1 and b = 2, return 3.题意就是不用+ -号进行求和运算。题解先看位运算的两个符号:一个是异或(^) 1^1=0原创 2016-08-20 11:35:02 · 299 阅读 · 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 order, "()" and "()[]{}" are all va原创 2016-06-16 15:56:00 · 192 阅读 · 0 评论 -
[leetcode] 【字符串】58. Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is原创 2016-06-15 22:07:57 · 220 阅读 · 0 评论 -
[leetcode] 【字符串】71. Simplify Path
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"Corner Cases:Did you consider the case where p原创 2016-06-15 16:50:47 · 210 阅读 · 0 评论 -
[leetcode] 【字符串】 49. Group Anagrams
Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note: Al原创 2016-06-15 16:47:55 · 298 阅读 · 0 评论 -
[leetcode] 【字符串】 38. Count and Say
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as原创 2016-06-15 15:53:46 · 247 阅读 · 0 评论 -
[leetcode] 【字符串】13. Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.题意把罗马数字转变为int型数据题解转变的规则 ://Ⅰ(1)Ⅴ(5)Ⅹ(10)L(50)C(100)D(500)M(1000)原创 2016-06-15 15:38:46 · 203 阅读 · 0 评论 -
[leetcode] 【字符串】 12. Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.题意把int型数据转换为罗马数字。题解根据罗马的转换制度由高到低转换即可 const int radix[] =原创 2016-06-15 15:08:35 · 228 阅读 · 0 评论 -
[leetcode] 【字符串】 65. Valid Number
Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguo原创 2016-06-15 11:35:40 · 255 阅读 · 0 评论 -
[leetcode] 【字符串】 14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.题意找字符串数组里的最长公共前缀。题解解法很多,第一个是横向匹配,第一组与每一组对比,每比一次取最小公共前缀。匹配完则得到所有公共前缀。能通过,但是比较慢class Solution {public:原创 2016-06-15 11:10:32 · 205 阅读 · 0 评论 -
[leetcode[ 【字符串】 44. Wildcard Matching
Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching should cover t原创 2016-06-14 23:59:19 · 215 阅读 · 0 评论 -
[leetcode] 【字符串】 10. Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input st原创 2016-06-14 22:30:14 · 164 阅读 · 0 评论 -
[leetcode] 【字符串】 5. Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.题意找S中的最长回文子串,回原创 2016-06-13 11:27:01 · 172 阅读 · 0 评论 -
[leetcode] 【栈】 32. Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()",原创 2016-06-16 16:08:25 · 254 阅读 · 0 评论 -
[leetcode] 【栈】 84. Largest Rectangle in Histogram
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width o原创 2016-06-16 16:48:59 · 189 阅读 · 0 评论 -
[leetcode] 【栈】150. Evaluate Reverse Polish Notation
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1"原创 2016-06-16 18:54:18 · 189 阅读 · 0 评论 -
[leetcode] 【查找】 74. Search a 2D Matrix
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each原创 2016-06-21 15:07:01 · 255 阅读 · 0 评论 -
[leetcode] 【查找】 35. 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 order.You may assume no duplicates in the array.原创 2016-06-21 11:24:32 · 239 阅读 · 0 评论 -
[leetcode] 【查找】 34. 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 order of O(log n).If the target is not found原创 2016-06-21 09:33:42 · 228 阅读 · 0 评论 -
[leetcode] 【分治法】 69. Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.题意实现平方根函数,返回x的根。题解二分法,取到合适的数为止。class Solution {public: int mySqrt(int x) { if(x<2) return x; double原创 2016-06-21 00:39:50 · 390 阅读 · 0 评论 -
[leetcode] 【分治法】 50. Pow(x, n)
Implement pow(x, n).题意实现幂函数。题解使用分治法求解。分:将n分成n/2 直到n=0时,返回1;治:对n为偶数,返回两数相乘的结果,奇数再乘多一个x; class Solution {public: double myPow(double x, int n) { if(n<0) return 1/power(x,-n原创 2016-06-21 00:37:26 · 562 阅读 · 0 评论 -
[leetcode] 【排序】 75. Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers原创 2016-06-20 19:00:36 · 232 阅读 · 0 评论 -
[leetcode] 【排序】 41. First Missing Positive
Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant原创 2016-06-20 18:12:18 · 240 阅读 · 0 评论 -
[leetcode] 【排序】 148. Sort List
Sort a linked list in O(n log n) time using constant space complexity.题意对链表进行排序,时间复杂度O(n log n),空间复杂度为常数。题解可原创 2016-06-20 13:20:20 · 200 阅读 · 0 评论 -
[leetcode] 【排序】 147. Insertion Sort List
Sort a linked list using insertion sort.题意用插入排序算法为链表排序。题解遍历原链表的每个元素,每个元素都有在新链表中从头往后找适合其的位置,然后插入。/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode原创 2016-06-20 13:00:07 · 234 阅读 · 0 评论 -
[leetcode] 【排序】 23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.题意合并k个排好序的链表,并返回这个排好序的链表。题解两个两个合并,即复用[leetcode] 【排序】 21. Merge Two Sorted Lists这题的函数。/**原创 2016-06-20 12:46:13 · 250 阅读 · 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.题意合并两个链表,新的链表由两个链表的节点组成。题解和归并类似,一步步取两条链最小那个节点即可。原创 2016-06-20 12:11:19 · 246 阅读 · 0 评论 -
[leetcode] 【排序】 88. Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold add原创 2016-06-20 11:56:10 · 194 阅读 · 0 评论 -
[leetcode] 【字符串】 67. Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".题意两个字符串表示两个二进制数,返回二进制的字符串表示他们的和。题解我是先翻转再操作,这样可以从下标0开始操作。注意长度,以及最后进位。原创 2016-06-13 11:00:30 · 220 阅读 · 0 评论 -
[leetcoide] 【字符串】8. String to Integer (atoi)
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input ca原创 2016-06-13 10:43:51 · 177 阅读 · 0 评论 -
[leetcoide] 【字符串】28. Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.题意两个字符串haystack和needle ,如果needle是haystack的子串,返回needle在haystack原创 2016-06-12 10:25:41 · 209 阅读 · 0 评论 -
[leetcode] 【链表】2. 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 digit. Add the two numbers and return it as a link原创 2016-05-30 11:12:49 · 187 阅读 · 0 评论 -
[leetcode] 第一类--【数组】 题大纲
第一类关于数组的题都写完了,大多数都还是比较经典的题。在学习的路上,大家一起努力~60. Permutation Sequence 36. Valid Sudoku42. Trapping Rain Water48. Rotate Image26. Remove Duplicates from Sorted Array80. Remove Duplicat原创 2016-05-30 10:56:47 · 342 阅读 · 0 评论 -
[leetcode] 【数组】 137. Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u原创 2016-05-30 10:32:18 · 256 阅读 · 0 评论 -
[leetcode] 【数组】 136. Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using e原创 2016-05-30 10:21:59 · 227 阅读 · 0 评论 -
[leetcode] 【数组】 135. Candy
There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least on原创 2016-05-29 23:23:09 · 435 阅读 · 0 评论 -
[leetcode] 【数组】134. Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to原创 2016-05-29 23:06:40 · 279 阅读 · 0 评论 -
[leetcode] 【数组】73. Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.题意给定一个二维数组表示一个矩阵,如果某个元素为0,那么把这个元素所在行和列的所有元素置为0。不使用额外空间。题解使用额外的空间的话,就是做两个一维数组,分别标记哪一行哪一列有0,然后把这些行和原创 2016-05-28 11:42:42 · 1473 阅读 · 0 评论 -
[leetcode] 【数组】 89. Gray Code
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of原创 2016-05-28 10:59:36 · 284 阅读 · 0 评论 -
[leetcode] 【数组】70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?题意 爬一个n阶楼梯,每次可以爬1-2步,问有多少种原创 2016-05-25 14:37:04 · 249 阅读 · 0 评论