leetcode
文章平均质量分 69
LimingLiuLiming
这个作者很懒,什么都没留下…
展开
-
Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 中位数是第K个数,K = (m + n)/2,,不原创 2015-07-31 10:51:37 · 325 阅读 · 0 评论 -
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-08-01 17:15:05 · 308 阅读 · 0 评论 -
Roman to Integer
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 和整数转罗马数字一样,根据转换规则转换。 class Solution { public: //分析最近的两个字符,如果i字符比i-1字符小,那么此时应该是s原创 2015-08-01 18:09:33 · 304 阅读 · 0 评论 -
Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit st原创 2015-08-01 22:28:19 · 431 阅读 · 0 评论 -
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 L S I原创 2015-08-01 16:24:55 · 265 阅读 · 0 评论 -
Integer to Roman
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 此题找规律模拟操作,分析1-10的整数是如何构造出罗马数字的,然后再依葫芦画瓢,注意细节的处理。class Solution { public: string In原创 2015-08-01 17:54:11 · 312 阅读 · 0 评论 -
Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 求解最长公共前缀,看到第一反应是用trie树,简历一颗trie树,然后查找下,某个点的计数次数是不是等于len,不等于则停止,等于则加入公共前缀字符串,继续查找。 class TrieNode { public:原创 2015-08-01 18:46:43 · 333 阅读 · 0 评论 -
3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: Elements in a triplet (a,b,c原创 2015-08-01 21:25:24 · 382 阅读 · 0 评论 -
Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin原创 2015-08-01 17:34:54 · 294 阅读 · 0 评论 -
Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. Y原创 2015-08-02 10:43:45 · 425 阅读 · 0 评论 -
Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 类似于归并排序的处理,这里将一个个链表看成一个个有序的元素。 /** * Definition for singly-linked list. * struct ListNode { *原创 2015-08-02 10:29:26 · 303 阅读 · 0 评论 -
Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is原创 2015-08-02 14:40:40 · 422 阅读 · 0 评论 -
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-08-02 15:23:46 · 320 阅读 · 0 评论 -
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-08-02 15:59:48 · 317 阅读 · 0 评论 -
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-08-01 17:07:46 · 479 阅读 · 0 评论 -
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. 题目最暴力的方法是,枚举字原创 2015-08-01 16:06:33 · 329 阅读 · 0 评论 -
Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, whe原创 2015-07-31 14:56:51 · 266 阅读 · 0 评论 -
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原创 2015-07-07 22:55:09 · 316 阅读 · 0 评论 -
Construct Binary Tree from Inorder and Postorder Traversal
这题应该算比较常见的题目了,基本的数据结构题目;递归构建每棵子树,唯一需要注意的是计算左子树的根节点在postorder的下标。 class Solution { public: //递归建树 unordered_map InMap; void BuildSubTree(vector &inorder, vector &postorder, int postInd原创 2015-05-15 15:33:09 · 407 阅读 · 0 评论 -
Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal i原创 2015-07-29 10:57:22 · 274 阅读 · 0 评论 -
Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine i原创 2015-05-15 17:21:12 · 344 阅读 · 0 评论 -
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原创 2015-07-31 14:48:04 · 359 阅读 · 0 评论 -
Number of Digit One
Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n. For example: Given n = 13, Return 6, because digit 1 occurred in the follow原创 2015-07-16 16:29:40 · 452 阅读 · 0 评论 -
Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given "25525511135", return ["255.255.11.135", "255.255.111.35"]. (Order原创 2015-06-21 20:37:07 · 426 阅读 · 0 评论 -
Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution set must not contain du原创 2015-05-15 16:42:23 · 553 阅读 · 0 评论 -
Word Search leetCode,,
Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically原创 2015-05-15 10:51:05 · 380 阅读 · 0 评论 -
Course Schedule
There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as原创 2015-07-17 00:02:16 · 317 阅读 · 0 评论 -
Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo原创 2015-07-31 15:52:03 · 371 阅读 · 0 评论 -
Reverse Integer
Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 对于数值问题,首先一定要记住,一定要时刻注意溢出问题,这个题目不难,就是要注意对于x >= INT_MAX 或者 x class Solution { public: //边求每一位,边反转原创 2015-08-01 16:35:20 · 368 阅读 · 0 评论 -
3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact原创 2015-08-01 22:07:19 · 303 阅读 · 0 评论 -
Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: "((()))", "(()())", "(())()", "()(())", "()()()原创 2015-08-02 09:49:00 · 324 阅读 · 0 评论