zrh_CSDN的博客

Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'.方法一：C语言bool isMatch(char* s, char* p) {    if(s==NULL || p==NULL)return false;      if(!...

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 possible ord...

Given a string, find the length of the longest substring without repeating characters.class Solution {public:    int lengthOfLongestSubstring(string s)     {        map<char,int> maps;        in...

class Solution {public:    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2)     {        int m=nums1.size(),n=nums2.size();        if((m+n)%2==1)            re...

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example 1:Input: "babad"Output: "bab"Note: "aba" is also a valid answer.Exa...

class Solution {public:    string convert(string s, int numRows)     {        if(numRows==1)           return s;        int step=2*numRows-2;        int n=s.size();        string ret="";        for(in...

Given a 32-bit signed integer, reverse digits of an integer.class Solution {public:    int reverse(int x)    {         int ans=0,temp=0;        while(x!=0)        {            temp=ans*10+x%10;       ...

class Solution {public:    int myAtoi(string str)     {        int n=str.size();        int flag=1,i=0,ret=0;        if(n==0)            return 0;        while(str[i]==' ')            i++;        if(s...

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.class Solution {public:    bool isPalindrome(int x)     {        if(x<0)         ...

class Solution {public:    int maxArea(vector<int>& height)     {        int l=0,r=height.size()-1;        int area=0;        while(l<r)        {            area=max(area,min(height[l],he...

class Solution {public:    string longestCommonPrefix(vector<string>& strs)    {        int n=strs.size();        string res="";        if(n==0)            return res;        if(n==1)       ...

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 in t...

Given an array of integers nums 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 tar...

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.clas...

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:Each row must contain the digits 1-9 without repetition.Each column must contain t...

The count-and-say sequence is the sequence of integers with the first five terms as following:1. 12. 113. 214. 12115. 1112211 is read off as "one 1" or 11.11 is read off as "t...

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations incandidates where the candidate numbers sums to target.The same repeated ...

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations incandidates where the candidate numbers sums to target.Each number in candidates may on...

Given a collection of distinct integers, return all possible permutations.class Solution {public:    vector<vector<int>> permute(vector<int>& nums)     {        vector<vector&...

Given a collection of numbers that might contain duplicates, return all possible unique permutations.class Solution {public:    vector<vector<int>> permuteUnique(vector<int>& num...

You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note:You have to rotate the image in-place, which means you have to modify the input 2D matrix directl...

Implement pow(x, n), which calculates x raised to the power n (xn).Note:-100.0 < x < 100.0n is a 32-bit signed integer, within the range [−231, 231 − 1]class Solution {public:    double myPow(do...

Given an array of strings, group anagrams together.Example:Input: ["eat", "tea", "tan", "ate", "nat", "bat"],Output:[ ["ate","eat","tea"], ["nat",&amp

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Explanation: [...

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.class Solution {public:    vector<int> spiralOrder(vector<vector<int>>& ma...

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 if you ar...

Reverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULL/** * Definition for singly-linked list. * struct ListNode { *     int val; ...

Remove all elements from a linked list of integers that have value val./** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x),...

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.The solution set must not contain dupli...

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would ...

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given...

Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of tar...

Given a linked list, remove the n-th node from the end of list and return its head./** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int ...

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of b...

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./** * Definition for singly-linked list. * struct ListNode ...

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.class Solution {public:    vector<string> generateParenthesis(int n)     {        vector&lt...

Given a linked list, swap every two adjacent nodes and return its head./** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x),...

Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Example 1:Input: [1,3,null,null,2]  1  / 3  \  2Output: [3,1,null,null,2] ...

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota...

Sort a linked list in O(n log n) time using constant space complexity.Example 1:Input: 4->2->1->3Output: 1->2->3->4Example 2:Input: -1->5->3->4->0Output: -1->0->...