我的博客

方法1：中心回文法（时间复杂度O(n^2)）class Solution {public: string longestPalindrome(string s) { int n = s.length(); if (n==0) { return ""; } string ans = s.substr(0, 1); for (int i = 0; i < n -...

leetcode 647. Palindromic Substrings方法一：中心回文法class Solution {public: int countSubstrings(string s) { int n = s.length(); int ans = 0; for (int i = 0; i < n;i++) { for (int j = 0; i +...

450. Delete Node in a BST/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), righ...

1.字符串的最长公共字串(string s,string t) dp[i][j] = (s[i] == s[j] ? dp[i-1][j-1] + 1:0);2.字符串的最长公共子序列dp[i][j] = (s[i]==s[j]?dp[i-1][j-1]+1:max(dp[i-1][j],dp[i][j-1]))3.求s中和t一样的子序列的个数 （leetcode115 Distinct Subs...

leetcode 24. Swap Nodes in Pairs方法一：用指针的指针的方法(leetcode大神思路很巧妙)/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), nex...

int binary_find(vector<int> &a, int target) //查找等于目标的数的位置{ int left = 0; int right = a.size(); while (left<right) { int mid = left + (right - left) / 2; if (a[mid]<target) {...

1.堆排序void Heapify(vector<int>&res,int i,int size)//从i往下调整堆{ int left = 2 * i + 1; int right = 2 * i + 2; int max = i; if (left<size &&res[left]>res[max]) { max = lef...

double StringToDouble(string str){ double num_front = 0,num_end=0; int temp; for(int i = 0;i<str.length();i++){ if(str[i]=='.'){ temp = i; break; ...