LeetCode
struggleee_luo
你当温柔,却有力量
展开
-
LeetCode算法题之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 o原创 2015-03-27 15:55:08 · 457 阅读 · 0 评论 -
LeetCode算法题之Rotate Image
问题描述: You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 要求不能另开空间,一开始理解错了,后来画图明白了 解题思路: 首先以对角线为轴对称交换,再以中间列原创 2015-03-31 14:02:07 · 946 阅读 · 0 评论 -
LeetCode算法题之Multiply Strings
问题描述: Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative. 一个数字以字符串的形式相乘,这就意味着传统的乘法肯定不能满足,计算机表原创 2015-03-31 19:45:04 · 460 阅读 · 0 评论 -
LeetCode算法题之Valid Sudoku
问题描述: Determine if a Sudoku is valid, according to: http://sudoku.com.au/TheRules.aspx The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’. A partially fi原创 2015-04-07 13:50:23 · 478 阅读 · 0 评论 -
LeetCode算法题之int to Roman
问题描述: Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 将数字转换为罗马数字表示。 解题思路: 按照罗马数字组数标准组合即可,附罗马数字百度百科:http://baike.baidu.com/link?url=UUF_E原创 2015-04-07 23:01:46 · 507 阅读 · 0 评论 -
LeetCode算法题之Next Permutation
问题描述 Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest possi原创 2015-04-21 12:02:11 · 491 阅读 · 0 评论 -
LeetCode算法题之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 temp + n) to hol原创 2015-05-27 11:17:08 · 415 阅读 · 0 评论 -
LeetCode算法题之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 inpu原创 2015-05-27 15:19:57 · 427 阅读 · 0 评论 -
LeetCode算法题之Plus One
问题描述: 一个整数按位存储于一个vector中,排列顺序为:最高位在array[0] ,最低位在[n-1]。 解题思路: 从数组的最后一位开始加1,诸如999的数字加1后需要考虑进位。class Solution { public: vector<int> plusOne(vector<int>& digits) { vector<int> result;原创 2015-05-22 15:13:33 · 491 阅读 · 0 评论 -
趣味编程题之Blocked Billboard
During long milking sessions, Bessie the cow likes to stare out the window of her barn at two huge rectangular billboards across the street advertising “Farmer Alex’s Amazingly Appetizing Alfalfa” and原创 2018-01-18 17:00:06 · 1345 阅读 · 0 评论 -
LeetCode算法题之Anagrams
问题描述: Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case. Anagrams指的是具有如下特性的两个单词:在这两个单词当中,每一个英文字母(不区分大小写)所出现的次数都是相同的。 例如,“Unclear”和“Nu原创 2015-03-31 12:13:58 · 523 阅读 · 0 评论 -
LeetCode算法题之Permutations
问题描述: Given a collection of numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]. 给一个内部元素互不相等的集原创 2015-03-30 20:08:49 · 436 阅读 · 0 评论 -
LeetCode算法题之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 N A P原创 2015-02-03 12:48:46 · 582 阅读 · 0 评论 -
LeetCode算法题之Longest Common Prefix
class Solution { public: string longestCommonPrefix(vector &strs) { string shortestStr;//最短的字符串 int minLen = 1000000; //为空或者vector中仅有一个字符串,无需计算直接返回 if(strs.empty()) return ""; i原创 2015-01-29 15:13:31 · 448 阅读 · 0 评论 -
LeetCode算法题之Letter Combinations of a Phone Number
问题描述: 手机键盘上的数字对应着若干个字母,输入一组由数字组成的字符串,对应输出相应的字母的所有可能组合,顺序不限 解题思路: 暴力破解可以得到结果相当于遍历一棵树,可以使用数的遍历算法DFS 25 / 25 test cases passed. Status: Accepted Runtime: 3 ms原创 2015-03-16 16:24:36 · 425 阅读 · 0 评论 -
LeetCode算法题之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 v原创 2015-03-23 17:05:27 · 402 阅读 · 0 评论 -
LeetCode算法题之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原创 2015-03-26 17:15:00 · 450 阅读 · 0 评论 -
LeetCode算法题之Implement strStr()
问题描述: Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 字符串匹配 解题思路: 暴力破解和KMP算法,后者还没认真学习,直接一个个比较了! class Soluti原创 2015-03-27 09:58:21 · 532 阅读 · 0 评论 -
LeetCode算法题之Palindrome Number
问题描述: Determine whether an integer is a palindrome. Do this without extra space. 判断一个int型数据是不是回文数,保证计算空间不会溢出 解题思路: 转为字符串,进行前后比较 class Solution { public: bool isPalindrome(int x) { if(res原创 2015-02-02 16:45:48 · 512 阅读 · 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. 解题思路: 罗马数字的百度百科:http://baike.baidu.com/view/42061.htm 从最后一位开始向前计算,倒数第一个罗马数字跟倒数第二个原创 2015-01-28 22:36:28 · 558 阅读 · 0 评论 -
LeetCode算法题之Pow(x, n)
问题描述: Implement pow(x, n).自己写函数实现乘方运算 解题思路: 直接实现肯定超时,并且要考虑指数为0,指数为1,指数为负,底数为0的特殊情况,此题用递归方法实现, 以下代码来自《剑指offer》,此代码写的太赞了,如果想详细了解解题思路请买书!!刚看完所以直接贴上去运行了,必然轻松A过,向大神致敬!!! bool g_InvalidInput = fals原创 2015-03-27 17:35:51 · 467 阅读 · 0 评论 -
趣味编程题之Milk Measurement
Farmer John purchases three cows: Bessie, Elsie, and Mildred, each of whom initially produces 7 gallons of milk per day. Since the milk output of a cow is known to potentially change over time, Farmer原创 2018-01-18 17:02:07 · 1139 阅读 · 0 评论