u012792707的博客

题目：https://leetcode.com/problems/two-sum/#/descriptionclass Solution {public: vector twoSum(vector& nums, int target) { map s; vector res; for(int i=0;i<nums.size();i++)

题目：https://leetcode.com/problems/integer-to-roman/#/description代码：class Solution {public: string intToRoman(int num) { string temp; string str[]={"M", "CM", "D", "CD", "C", "X

题目：https://leetcode.com/problems/remove-element/#/descriptionclass Solution {public: int removeElement(vector& nums, int val) { int len=nums.size(),num=0; for(int i=0;i<len;i++)

题目：https://leetcode.com/problems/swap-nodes-in-pairs/description/代码：class Solution {public: ListNode* swapPairs(ListNode* head) { if(head == NULL) return NULL; L

题目：https://leetcode.com/problems/generate-parentheses/description/代码：class Solution {public: vector generateParenthesis(int n) { vector res; string t; trans(t,res,0,0,

题目：https://leetcode.com/problems/string-to-integer-atoi/description/代码：class Solution {public: int myAtoi(string str) { if(str == "") return 0; int pos = 0,temp=1; doubl

题目：https://leetcode.com/problems/container-with-most-water/description/代码：class Solution {public: int maxArea(vector& height) { int mx= 0,i=0,j=height.size()-1; while(i<j){

题目：https://leetcode.com/problems/longest-substring-without-repeating-characters/description/代码：class Solution {public: int lengthOfLongestSubstring(string s) { int maxlen =0,pos=-1;

题目：https://leetcode.com/problems/implement-strstr/tabs/description/代码：class Solution {public: int strStr(string a, string b) { int i,j,len1=a.size(),len2=b.size(); if(!len2) retur

传送门int searchInsert(int* nums, int numsSize, int target) { int i=0; while(target>nums[i]&&i<numsSize){ i++; } return i;}

题目：https://leetcode.com/problems/count-and-say/tabs/description代码：class Solution {public: string countAndSay(int n) { string temp="1",res; int count; if(n==0) return "";

题目:https://leetcode.com/problems/longest-palindromic-substring/description/代码：class Solution {public: string longestPalindrome(string s) { if(s.length()<=1) return s; bool dp[s.

题目：https://leetcode.com/problems/length-of-last-word/tabs/description代码：class Solution {public: int lengthOfLastWord(string s) { if(s=="") return 0; int len=s.size(),i=len-1,cou

题目：https://leetcode.com/problems/climbing-stairs/tabs/description代码：class Solution {public: int climbStairs(int n) { int a[100]; a[0]=1,a[1]=2; for(int i=2;i<100;i++){

题目：https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/代码：class Solution {public: ListNode* removeNthFromEnd(ListNode* head, int n) { ListNode *pre=head,*q=pre;

题目：https://leetcode.com/problems/3sum/description/代码：class Solution {public: vector> threeSum(vector& nums) { vector> res; sort(nums.begin(), nums.end()); for (int k = 0

题目：https://leetcode.com/problems/4sum/description/代码：class Solution {public: vector> fourSum(vector& nums, int target) { vector > res; if(nums.size()==0) return res; sor

题目：https://leetcode.com/problems/3sum-closest/description/代码：class Solution {public: int threeSumClosest(vector& nums, int target) { if(nums.size() < 3) return 0; sort(nums.begi

题目：https://leetcode.com/problems/remove-duplicates-from-sorted-array代码：class Solution {public: int removeDuplicates(vector& nums) { int i,count =0; if(!nums.size()) return 0;

题目：https://leetcode.com/problems/add-two-numbers/description/代码：class Solution {public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { ListNode head(0), *res = &head; int

地址：https://leetcode.com/problems/pascals-triangle-ii/#/descriptionclass Solution {public: vector getRow(int rowIndex) { vector res(rowIndex+1); res[0]=1; for (int i = 0

地址：https://leetcode.com/problems/missing-number/#/description暴力低效率：class Solution {public: int missingNumber(vector& nums) { int i; maps; for(i=0;i<nums.size();i++){

地址：https://leetcode.com/problems/max-consecutive-ones/#/descriptionclass Solution {public: int findMaxConsecutiveOnes(vector& nums) { int t=1,max=0,sum=0; for(int i=0;i<nums.siz

地址：https://leetcode.com/problems/best-time-to-buy-and-sell-stock/#/descriptionclass Solution {public: int maxProfit(vector& prices) { if (prices.size() == 0) { ret

题目：https://leetcode.com/problems/plus-one/#/descriptionclass Solution {public: vector plusOne(vector& digits) { int t = 1; for(int i = digits.size() - 1; i >= 0; -- i)

题目：https://leetcode.com/problems/maximum-subarray/#/descriptionclass Solution {public: int maxSubArray(vector& nums) { int sum=nums[0],max_sum=nums[0]; for(int i=1;i<nums.size()

题目：https://leetcode.com/problems/add-binary/tabs/description代码：class Solution {public: string addBinary(string a, string b) { int i = a.size()-1,j = b.size()-1,temp=0; string c;

题目：https://leetcode.com/problems/sqrtx/tabs/description代码：class Solution {public: int mySqrt(int x) { double k=1.0; while(fabs(k*k-x)>0.01){ k=(k+x/k)/2; }

题目：https://leetcode.com/problems/reverse-integer/#/descriptionclass Solution {public: int reverse(int x) { long long sum=0; while(x!=0) { sum=sum*10+x%10;

题目：https://leetcode.com/problems/palindrome-number/#/description代码：bool isPalindrome(int x) { if(x < 0) return false; int t = x; double s = 0; while(x > 0){ s = s*1

题目：https://leetcode.com/problems/roman-to-integer/#/description代码：class Solution {public: int romanToInt(string s) { map t = { { 'I' , 1 }, { 'V' , 5 },

题目：https://leetcode.com/problems/longest-common-prefix/#/description代码：class Solution {public: string longestCommonPrefix(vector &strs) { if(strs.size() == 0)return ""; int len

题目：https://leetcode.com/problems/valid-parentheses/#/description代码：class Solution {public: bool isValid(string s) { stack t; for(int i=0;i<s.size();i++){ if(s[i]=='(

题目：https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/代码：class Solution {public: ListNode* deleteDuplicates(ListNode* head) { ListNode* temp = head; wh

题目：https://leetcode.com/problems/merge-sorted-array/description/代码：class Solution {public: void merge(vector& nums1, int m, vector& nums2, int n) { int i=m-1,j=n-1,k=m+n-1; wh

题目：https://leetcode.com/problems/same-tree/description/代码：class Solution {public: bool isSameTree(TreeNode* p, TreeNode* q) { if(p==NULL&&q==NULL) return true; else if(p==NULL&&

题目：https://leetcode.com/problems/merge-two-sorted-lists/#/description代码：class Solution {public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { ListNode *dummy = new ListNode(-1),

题目：https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/代码：class Solution {public: vector letterCombinations(string digits) { vector res; if(digits.si