helloed02的专栏

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

class Solution {public: int singleNumber(vector<int>& nums) { int dig[32] = {0}; for(auto i : nums){ for(int j = 0; j < 32; j++) { dig[j] += i&0x01;

class Solution {public: int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { int a = (C-A)*(D-B)+(G-E)*(H-F); if((C<=E)||(G<=A)||(H<=B)||(D<=F)) return a;

Longest Valid Parenthesesclass Solution {public: int longestValidParentheses(string s) { const int len = s.length(); stack<int> stk; vector<bool> v(len, false); for

Move Zeroesmy solutionclass Solution {public: void moveZeroes(vector<int>& nums) { const int len = nums.size(); int j = 0; for(int i = 0; i < len; i++){ if(nums[

欢迎使用Markdown编辑器写博客const int len1 = version1.length(); const int len2 = version2.length(); int i = 0, j = 0; while(i < len1 || j < len2){ int v1 = 0, v2 = 0;

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

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

class Solution {public: vector<string> res; void dfs(string s, int left, int right, int n){ if(left == n && right == n){ res.push_back(s); return; }

class Solution {public: void sortColors(vector<int>& nums) { int i = 0, j = nums.size()-1, k = 0; while(k < j + 1){ if(nums[k] == 0){ swap(nums[i++], nu

class Solution {public: string longestCommonPrefix(vector<string>& strs) { string s = ""; const int len = strs.size(); if(len == 0) return s; string cur = strs[0];

注意tempx需要记录改变x之前的值class Solution {public: bool isPalindrome(int x) { if(x < 0) return false; int res = 0, tempx = x; while(x){ if(res > INT_MAX/10) return false

class Solution {public: int reverse(int x) { bool isNeg = false; if(x < 0) { x = -x; isNeg = true; } int c = 0; while(x){

class Solution {public: int lengthOfLongestSubstring(string s) { int dic[256]; for(int i = 0; i < 256; i++) dic[i] = -1; int maxlen = 0, j = 0; for(int i = 0; i < s

class Solution {public: string dic[10] = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"}; vector<string> res; void dfs(string& digits, string s, int cur, int len){

class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> m; vector<int> res; for(int i = 0; i < nums.size(); i++){ m[

class Solution {public: int myAtoi(string str) { int i = 0; bool isNeg = false; while(isspace(str[i])) i++; if(str[i]=='-') isNeg = true; if(str[i]=='+' ||s

class Solution {public: string longestPalindrome(string s) { const int len = s.length(); int maxlen = 1, ii = 0, jj = 0; bool f[len+1][len+1]; for(int i = 0; i <= l

Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inputs are consist of lowercase letters a-z.这道题让我们实现一个重要但又有些复杂的数据结构-字典树， 又称前缀树或单词查找树，详细介绍可以参见网友董的博客，例如，一个保存了8