merge-链接
实现的代码如下：
12345678910class Solution {public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { for(int i=0;i<nums2.size();i++) { nums1[m++]=nums2[i]; } sort(nums1.begin(),nums1....
generate-链接
实现的代码如下：
杨辉三角I
12345678910111213141516171819class Solution {public: vector<vector<int>> generate(int numRows) { vector<vector<int>>ans; if(numRows<=0) return ans; ans.push_back({1}); for(int i=1;i<n...
rob-链接
实现的代码如下：
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110#include<iostream>#include<set>#include<vect...
ListNode* deleteDuplicates-链接
实现的代码如下：
123456789101112131415161718192021222324252627282930313233/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ...
singleNumber-链接
实现的代码如下：
12345678910111213class Solution {public: int singleNumber(vector<int>& nums) { sort(nums.begin(),nums.end()); int i; for(i=0;i<nums.size()-1;i+=2) { if(nums[i]!=nums[i+1]) ...
ListNode* mergeTwoLists-链接
实现的代码如下：
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NU...
maxSubArray-链接
实现的代码如下：
12345678910111213141516class Solution {public: int maxSubArray(vector<int>& nums) { int sum=0; int ans=nums[0]; for(int i=0;i<nums.size();i++) { sum+=nums[i]; ans=max(ans,sum); ...
countAndSay-链接
实现的代码如下：
12345678910111213141516171819202122232425class Solution {public: string countAndSay(int n) { vector<string>s(n+1,""); s[1]="1"; for(int i=2;i<=n;i++) { for(int j=0;s[i-1][j]!='\0&apo...
searchInsert-链接
实现的代码如下：
1234567891011121314151617181920212223242526272829class Solution {public: int searchInsert(vector<int>& nums, int target) { for(int i=0;i<nums.size();) { //找到不小于目标数的元素位置 while(target>nums[i]) ...
strStr-链接
实现的代码如下：
这是一道典型的字符串匹配题……直接用KMP算法然后就过了
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657class Solution {public: int strStr(string haystack, string needle) { //这里要考虑两种特殊的情况 if (needle.size() == 0) ...
