李昊的博客

【算法题】N 字形变换（桶排序法、C++实现、力扣第6题）

【算法题】反转链表（头插法、C++实现、力扣第206题、剑指offer第24题）

class Solution {public: int strToInt(string str) { if(count(str.begin(), str.end(), ' ') == str.size()) return 0; int res; stringstream ss; ss << str; ss >> res; return res; }};

求和表达式sum=x+xx+xxx+xxxx+…最后一项为n个x，请给出程序算法步骤及函数实现int sum_nx(int x, int n)其中x的参数范围为0~9，假设不考虑n个x及sum在int范围溢出情况。#include <iostream>using namespace std;int sum_nx(int x, int n){ long int sn = 0; long int tn = 0; int count = 1; while (count <= n)

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* rotateRight(ListNode* head, int k) { if(head == n.

class Solution {public: bool isValid(string s) { stack <char> t; for(auto n : s) { if (n == '(') { t.push(')'); }else if (n == '{') { t.push.

class Solution {public: int minDeletionSize(vector<string>& A) { int ans = 0; int n = A.size(), m = A[0].size(); for(int i = 0; i < m; i++){ for(int j = 0; j < n - 1; j++){ if(A[j][i.

class Solution {public: vector<string> permutation(string S) { vector<string> res; sort(S.begin(), S.end()); do { res.push_back(S); }while(next_permutation(S.begin(), S.end())); .

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* reverseBetween(ListNode* head, int m, int n) { if.

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: vector<int> list(ListNode* L) { vector<int>.

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: vector<int> reversePrint(ListNode* head) { if(!head).

class Solution {public: vector<string> permutation(string s) { vector<string> res; sort(s.begin(),s.end()); do{ res.push_back(s); }while(next_permutation(s.begin(),s.end())); return res;.

class Solution {public: vector<vector<int>> permuteUnique(vector<int>& nums) { sort(nums.begin(), nums.end()); vector<vector<int>> res; do { res.push_back(nums); }w.

class Solution {public: vector<vector<int>> permute(vector<int>& nums) { sort(nums.begin(), nums.end()); vector<vector<int>> res; do { res.push_back(nums); }while(n.

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* swapPairs(ListNode* head) { if(head == nullptr) .

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* reverseKGroup(ListNode* head, int k) { if(head ==.

class Solution {public: int myAtoi(string str) { int i = 0, flag = 1; long res = 0; //默认flag = 1，正数 while (str[i] == ' ') i ++; //若str全为空格，str[i] = '\0'(最后一个i) if (str[i] == '-') flag = -1; if (str[i] == '-' ||.

class Solution {public: string defangIPaddr(string address) { string res; for(int i = 0; i < address.size(); i++) { if(address[i] == '.') { res += "[.]"; } els.

class Solution {public: bool hasAlternatingBits(int n) { vector<int> tmp; while(n) { tmp.push_back(n % 2); n /= 2; } for(int i = 0; i < tmp.size() - 1; i++) { .

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} *.

class Solution {public: int hammingDistance(int x, int y) { vector<int> vecx; vector<int> vecy; while(x) { vecx.push_back(x % 2); x /= 2; } while(y) { .

class Solution {public: string frequencySort(string s) { set<char> tmp; for(int i = 0; i < s.size(); i++) { tmp.insert(s[i]); } multimap<int, char> m; for(auto it = tmp.begin(.

参考链接：https://www.cnblogs.com/houjun/p/10063468.html

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: bool isPalindrome(ListNode* head) { vector<int> vec;.

class Solution {public: vector<int> subSort(vector<int>& array) { if(!array.size()) { return {-1, -1}; } vector<int> res; vector<int> temp = array; sort(temp.begi.

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: bool isSameTree(TreeNode* p, T.

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: vector<int> res; vec.

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: bool isPalindrome(ListNode* head) { vector<int> vec;.

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: void dfs(TreeNode* node, vect..

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* sortList(ListNode* head) { if(head == nullptr) .

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* insertionSortList(ListNode* head) { if(head == nu.

class Solution {public: string restoreString(string s, vector<int>& indices) { string temp = s; for(int i = 0; i < indices.size(); i++) { char c = s[i]; s[i] = temp[indices[i]]; ..

class Solution {public: bool canMakeArithmeticProgression(vector<int>& arr) { sort(arr.begin(), arr.end()); for(int i = 0; i < arr.size() - 1; i++) { if(arr[i + 1] - arr[i] != arr[1] - arr[0]) .

参考链接：https://leetcode-cn.com/problems/binary-tree-inorder-traversal/solution/die-dai-fa-by-jason-2//** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(

参考链接：https://leetcode-cn.com/problems/binary-tree-inorder-traversal/solution/die-dai-fa-by-jason-2//** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(

参考链接：https://www.jianshu.com/p/88af12725af8/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution

class Solution {public: int maxProduct(vector<int>& nums) { sort(nums.begin(), nums.end()); return (nums[nums.size() - 1] - 1) * (nums[nums.size() - 2] - 1); }};

class Solution {public: int findMaxConsecutiveOnes(vector<int>& nums) { int res = 0; int count = 0; for(int i = 0; i < nums.size(); i++) { if(nums[i] == 1) { count++.

class Solution {public: bool canBeEqual(vector<int>& target, vector<int>& arr) { sort(target.begin(), target.end()); sort(arr.begin(), arr.end()); if(target == arr) { return true; .

class Solution {public: bool isMonotonic(vector<int>& A) { vector<int> B = A; vector<int> C = A; sort(B.begin(), B.end()); sort(C.begin(), C.end(), greater<int>()); if(A == B || A .