leetcode
银色子弹lx
北京邮电大学硕士
展开
-
Leetcode1: Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space?class Soluti原创 2015-04-08 11:00:44 · 516 阅读 · 0 评论 -
Leetcode2: Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as yo原创 2015-04-09 16:23:25 · 414 阅读 · 0 评论 -
Leetcode3:Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]此题和Pascal's TriangleⅡ类型一样原创 2015-04-09 22:39:18 · 399 阅读 · 0 评论 -
Leetcode4: Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.Credits:Special thanks to @ts for adding this problem and creating原创 2015-04-10 20:53:23 · 380 阅读 · 0 评论 -
Leetcode5: Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321给出大牛的解法,这题实在不知道怎么解,原谅LZ的智障 -。-class Solution {public: int reverse(int x) { int sig原创 2015-04-11 15:03:56 · 323 阅读 · 0 评论 -
Leetcode6: Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of convertin原创 2015-04-11 15:57:02 · 449 阅读 · 0 评论 -
Leetcode7: 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 to m + n) to hold additional elements fro原创 2015-04-12 14:06:43 · 422 阅读 · 0 评论 -
Leetcode8: Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.这题干LZ看了半天才懂,意思是给你一个数原创 2015-04-16 14:23:28 · 525 阅读 · 0 评论 -
Leetcode9: Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".看看自己写的代码,渣的不行。把string先转成数字,相加后再对每一位判断是否大于1,最后生成的数字再转成string,真是完全不把string当回事啊原创 2015-04-16 20:58:54 · 394 阅读 · 0 评论 -
Leetcode10: 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?思路很简单,一个台阶的时候需要1步,只有一种方法;两个台原创 2015-04-18 21:14:42 · 400 阅读 · 0 评论 -
Leetcode11: Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.这原创 2015-04-19 12:51:36 · 336 阅读 · 0 评论 -
Leetcode12: 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原创 2015-04-20 18:32:14 · 460 阅读 · 0 评论 -
Leetcode13: 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 length.Do not allocate extra space for another array, you must do this in place with原创 2015-04-20 20:19:54 · 475 阅读 · 0 评论 -
Leetcode14: House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house原创 2015-04-21 14:33:04 · 618 阅读 · 0 评论 -
Leetcode15: Happy Number
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares原创 2015-04-22 17:19:44 · 526 阅读 · 0 评论 -
Leetcode16: Number of 1 Bits
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 000000原创 2015-04-23 10:09:57 · 667 阅读 · 0 评论 -
Leetcode17: 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: Panama" is a palindrome."race a car" is not a原创 2015-04-24 16:02:24 · 475 阅读 · 0 评论 -
Leetcode18: Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element原创 2015-04-30 14:34:49 · 388 阅读 · 0 评论 -
Leetcode19: Pow(x,n)
Implement pow(x, n).class Solution {public: double myPow(double x, int n) { if(n == 0) return 1.0; if(n < 0) return 1.0/myPow(x, -n); do原创 2015-05-01 16:05:56 · 366 阅读 · 0 评论 -
Leetcode20: 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.click to show follow up.Follow up:Did you use extra space?A straight forward solution using O(m原创 2015-05-04 16:20:24 · 410 阅读 · 0 评论 -
Leetcode21: Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get原创 2015-05-06 17:25:10 · 387 阅读 · 0 评论 -
Leetcode22: 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原创 2015-05-06 20:18:38 · 431 阅读 · 0 评论 -
Leetcode23: 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原创 2015-05-07 09:49:43 · 584 阅读 · 0 评论 -
Leetcode24: 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原创 2015-05-07 17:06:04 · 372 阅读 · 0 评论 -
Leetcode25: Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.求若干字符串的最长公共前缀。首先若无字符串,返回“”;接下来求得其中最短字符串的长度len,比较公共前缀只需最多比较len次;最后比较所有字符串里每一位上的字符。class Solution {public:原创 2015-05-08 17:04:27 · 514 阅读 · 0 评论 -
Leetcode26: ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I原创 2015-05-12 22:18:10 · 364 阅读 · 0 评论 -
Leetcode27: Count Primes
Description:Count the number of prime numbers less than a non-negative number, nclass Solution {public: int countPrimes(int n) { bool *a = new bool[n]; for(int i = 2; i*i原创 2015-05-18 11:16:35 · 372 阅读 · 0 评论 -
Leetcode28: Isomorphic Strings
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with anot转载 2015-05-18 16:59:47 · 403 阅读 · 0 评论 -
Leetcode29: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原创 2015-05-20 10:59:41 · 547 阅读 · 0 评论 -
Leetcode30: Reverse Bits
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as0011100101转载 2015-05-20 21:42:40 · 432 阅读 · 0 评论 -
Leetcode31: Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element原创 2015-05-25 16:30:13 · 475 阅读 · 0 评论 -
Leetcode32: Excel Sheet Column Number
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ...原创 2015-05-27 16:55:22 · 537 阅读 · 0 评论 -
Leetcode33: Excel Sheet Column Title
Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB Credits原创 2015-05-27 20:15:33 · 487 阅读 · 0 评论 -
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 · 363 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论