you-know-who的博客

#include#include#include#includeusing namespace std;class Solution {public: string longestPalindrome(string s) { if(s.empty())return s; string temp; for(int i=0;i<s.s

把一个字符串转换为一个整型数，题目描述在这里代码贴在这里：#include#include#include#includeusing namespace std;int myAtoi(string str) { //跳过前面的空格字符，直到遇上数字或正负号才开始做转换， if(str.empty())return 0; //而再遇到非数字或字符串时

题目在这代码如下：class Solution {public: vector> threeSum(vector& nums) { vector>ret; auto sz=nums.size(); if(sz<3)return ret; sort(nums.begin(),nums.end()); f

求最长上升子序列的内容，典型的dp问题解法如下#include#include#includeusing namespace std;int longestIncreasingSubsequence(const vector&v){ if(v.empty())return 0; vectorret(v.size(),1); for(int i=1;i!=ret.size()

查到目标点所在区间 in soreted arrayclass Solution {public: vector searchRange(vector& nums, int target) { vectorret(2,-1); if(nums.empty())return ret; int beg=-1,end=nums.size();

移除元素把0搬移到数组尾部#include#includeusing namespace std;void moveZeros(vector&v){ int last=0; auto sz=v.size(); for(int i=0;i!=sz;++i){ if(v[i]!=0)swap(v[i],v[last++]); }}int removeElement