sst2230879的博客

题目： Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2. Note: The length of both num1 and num2 is < 110. Both num1 and num2 contains only digi

题目： You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once a

题目： Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.链接：Implement strStr() 解法：两重循环暴力求解。时间O(mn)class Solution {public:

题目： Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory.

题目： 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 w

题目：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.连接：Merge Two Sorted Lists 解法：比较两链表头值大小，将小者插入新链表尾，若任一链表为空

题目： Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT.链接：Divide Two Integers 解法：将除法转换为减法，被除数每次减去的值翻倍，注意符号的变化和临界值处理。时间O(logn)class Soluti

题目： 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 vali

题目： Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the l

题目： 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 possib

题目： 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 “()”, wh

题目： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found

题目： Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. For example, Given [0,1,0,2,1,0,1,3,2,1,2

题目： 吝啬SAT问题是这样的：给定一组子句（每个子句都是其中文字的析取）和整数k，求一个最多有k个变量为true的满足赋值——如果该赋值存在。证明吝啬SAT是NP-完全问题。SAT问题： 假设有子句: (a⋃b⋃c)⋂(a⋃b¯)⋂(b⋃c¯)(a¯⋂c)⋂(a¯⋃b¯⋃c¯) 求a,b,c的取值（true or false）使得该表达式的结果是true。不难发现，这个表达式不存在一个合适

题目： 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 constan

题目： Given an array of integers sorted in ascending order, 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

题目： 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 arr

题目： Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once in the combin

题目： Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen

题目： The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 111221 1 is read off as “one 1” or 11. 11 is

题目： Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to the length of the linked list. If the numbe

题目： 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.

题目： Given a string, find the length of the longest substring without repeating characters.Examples: Given “abcabcbb”, the answer is “abc”, which the length is 3. Given “bbbbb”, the answer is “b”, w

题目： 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)).Example 1: nums1 = [1,

题目： Write a function to find the longest common prefix string amongst an array of strings.链接：Longest Common Prefix 解法：逐个字符比较，时间O(N*L)，N是字符串个数，L是最长前缀的长度class Solution {public: string longestComm

题目： Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.链接：Roman to Integer 解法：用数组存字母表示的数class Solution { public: int romanToInt(string

题目： Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. ps: I = 1; V = 5; X = 10; L = 50; C = 100; D = 500; M = 1000;链接：Integer to Rom

题目： 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). Find t

题目： 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 in

题目： 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

题目： You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and retu

【LeetCode算法练习（C语言）】Two Sum题目：给定一个整型数组，返回两个数的下标，满足两个数相加为一个特定整数。假定只有一个正确答案 例如： nums = [2, 7, 11, 15], target = 9,因为nums[0] + nums[1] = 2 + 7 = 9,返回[0,1] 链接：Two Sum解法：穷举，时间O(n^2)int* twoSum(int* nums,

题目： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example: Input: “babad” Output: “bab” Note: “aba” is also a valid answer.Exam

题目： Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.链接：Merge k Sorted Lists 解法：递归实现归并，利用merge Two Lists，每次合并两个序列。时间O(nlogn)class Solution {public:

题目： 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: [ “((()))”, “(()())”, “(())()”, “

题目： Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target. Note: The solutio

题目： 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 s

题目： 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. For example, given array S = [-1, 0, 1

题目： Determine whether an integer is a palindrome. Do this without extra space.链接：Palindrome Number 解法：循环，与itoa类似，时间O(n)class Solution {public: bool isPalindrome(int x) { int ans = 0, y

题目： 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 exa