for {i++}

class Solution { public:     vector<string> fullJustify(vector<string>& words, int L) {         vector<string> ans;         const int n = words.size();         for (int i = 0; i < n;) {             int num = 0, len = 0;             while (i + num < n && words[i + num].size() + len <= L - num) {                 len += words[i + num].size();                 ++num;             }             string tmp = words[i];          ...

class Solution { public:     vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {         vector<vector<pair<int, vector<int>>>> dp;         for (int i = 0; i < candidates.size(); i++)         {             vector<pair<int, vector<int>>> tmp;             int cur = candidates[i];             if (i > 0)             {                 vector<pair<int, vector<int>>> & pre = dp[i - 1];               ...

/**  * 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:     int maxPathSum(TreeNode* root) {                 if (root->left != 0 && root->right != 0)         {             int l = maxPathSum(root->left);             int r = maxPathSum(root->right);             int l1 = maxPathSum3(root->left);             int r1 = maxPathSum3(root->right);  ...

class Solution { public:     bool isPalindrome(string word, int left, int right) {         while (left < right)             if(word[left++] != word[right--]) return false;         return true;     }         string reverse(string tmp)     {         string ret;         for (int i = tmp.length() - 1; i >= 0; i--)         {             ret.push_back(tmp[i]);         }         return ret;     }         vector<vector<int>> palindromePairs(vector<string>& words) {       ...

class Solution { public:     vector<int> lexicalOrder(int n) {         vector<int> ret;         lexicalOrder2(n, 0, ret);         return ret;     }         void lexicalOrder2(int n, int pre, vector<int> & ret)     {         if (ret.size() >= n)         {             return;         }                 for (int i = (pre==0?1:0);i<=9;i++)         {             if ((long long)pre*10+i <= (long long)n)             { ...

class Solution { public:     bool isAnagram(string s, string t) {         char data1[26] = {0};         char data2[26] = {0};                 if (s.length() != t.length())             return false;                 for (int i = 0; i < s.length(); i++)         {             data1[s[i] - 'a']++;         }         for (int i = 0; i < t.length(); i++)         {             data2[t[i] - 'a']++;         }     ...

class Solution { public:     void reverseString(vector<char>& s) {         int i = 0;         int j = s.size() - 1;         while (i < j)         {             char tmp = s[i];             s[i] = s[j];             s[j] = tmp;             i++;             j--;         }     } };

class Solution { public:     int firstUniqChar(string s) {         map<char, pair<int, int>> tmp;         for (int i = 0; i < s.length(); i++)         {             if (tmp.find(s[i]) != tmp.end())             {                 tmp[s[i]].second++;             }             else             {                 tmp[s[i]] = make_pair(i, 0);             }      ...

class Solution { public:         bool isValid(char c)     {         if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9'))         {             return true;         }         return false;     }         bool isPalindrome(string s) {         int i = 0;         int j = s.length() - 1;         while (i < j)         {             if (!isValid(s[i]))             {      ...

class Solution { public:     bool isPowerOfThree(int n) {         while (n > 0)         {             if (n == 1)                 return true;             if (n % 3 != 0)                 return false;             n /= 3;         }         return false;     } };

class Solution { public:     int missingNumber(vector<int>& nums) {         int sum = nums.size() * (nums.size() + 1) / 2;                 int sum2 = 0;         for (int i = 0; i < nums.size(); i++)         {             sum2 += (nums[i]);         }                 return sum - sum2;     } };

class Solution { public:     int countPrimes(int n)     {         if (n <= 1)         {             return 0;         }         bool * isPrime = new bool[n + 1];         for (int i = 0; i < n + 1; i++)         {             isPrime[i] = true;         }         vector<int> prime;         int res = 0;         for (int i = 2; i < n; i++)         {             if (isPrime[i])      ...

class Solution { public:     int hammingWeight(uint32_t n) {         int ret = 0;         while (n != 0)         {             ret += n & 1;             n = n >> 1;         }         return ret;     } };

class Solution { public:     uint32_t reverseBits(uint32_t n) {                 int ret = 0;         for (int i = 0; i < 32; i++)         {             int mask = 1 << i;             int tmp = mask & n;             tmp = (tmp >> i) & 1;             tmp = tmp << (32 - i - 1);             ret = ret | tmp;         }         return ret;     } };

class Solution { public:     int trailingZeroes(int n) {         int total = 0;         while (n >= 1)         {             n /= 5;             total += n;         }         return total;     } };

class Solution { public:         string itoa(long long i)     {         char buff[100];         sprintf(buff, "%lld", i);         return buff;     }     string fractionToDecimal(int num, int den) {         long long numerator = num;         long long denominator = den;         int neg = 1;         if (numerator > 0 && denominator < 0)         {             neg = -1;         }         if (numerator < 0 && denominator > 0)         {    ...

/**  * Definition for a point.  * struct Point {  *     int x;  *     int y;  *     Point() : x(0), y(0) {}  *     Point(int a, int b) : x(a), y(b) {}  * };  */ class Solution { public:     int maxPoints(vector<Point>& points) {                 if (points.size() <= 2)         {             return points.size();         }                 set<double> find;         set<double> findx;         set<double> findy;         int max = 0;      ...

class Solution { public:     int singleNumber(vector<int>& nums) {         int ret = 0;         for (int i = 0; i < nums.size(); i++)         {             ret ^= nums[i];         }         return ret;     } };

class Solution { public:         void numIslands2(vector<vector<char>>& grid, int i, int j, int & nn, vector<vector<char>> & find) {         int m = grid.size();         int n = grid[0].size();         if (i >= 0 && i < m && j >= 0 && j < n && grid[i][j] == '1' && find[i][j] == 0)         {             find[i][j] = nn;             numIslands2(grid, i + 1, j, nn, find);             numIslands2(grid, i, j + 1, nn, find);             numIslands2(grid, i - 1, j, nn, find);         ...

class Solution { public:     int ladderLength(string beginWord, string endWord, vector<string>& wordList) {                 map<int, map<string, vector<string>>> tree;         for (int i = 0; i < wordList.size(); i++)         {             for (int j = 0; j < wordList[i].size(); j++)             {                 string s = wordList[i];                 s.erase(j, 1);                 map<string, vector<string>> & m = tree[j];      ...

class Solution { public:         int longestIncreasingPath(vector<vector<int>> &matrix)     {         if (matrix.size() == 0)             return 0;                 int xmax = matrix.size();         int ymax = matrix[0].size();         int ** tmp = new int*[xmax];         for (int i = 0; i < xmax; i++)         {             tmp[i] = new int[ymax];             for (int j = 0; j < ymax; j++)             {           ...

class Solution { public:     int coinChange(vector<int>& coins, int amount) {              if (amount == 0)             return 0;                 vector<int> dp;         int max = amount;         for (int i = 0; i < coins.size(); i++)         {             if (coins[i] > max && coins[i] != INT_MAX)             {                 max = coins[i];             }         }     ...

class Solution { public:     int lengthOfLIS(vector<int>& nums) {                 if (nums.size() == 0)             return 0;                 int * dp = new int[nums.size()];         for (int i = 0; i < nums.size(); i++)         {             dp[i] = 1;         }                     for (int i = 1; i < nums.size(); i++)         {                         for (int j = 0; j < i...

class Solution { public:     int numSquares(int n) {         int * dp = new int[max(n + 1, 3)];         dp[0] = 0;         dp[1] = 1;         dp[2] = 2;         for (int i = 3; i <= n; i++)         {             int min = INT_MAX;             for (int j = sqrt(i); j >= 1; j--)             {                 int mm = dp[i - j * j] + 1;                 if (min > mm)               ...

class Solution { public:     int rob(vector<int>& nums) {         vector<int> ret;         int mm = 0;         for (int i = 0; i < nums.size(); i++)         {             int m = max(i>=2?(ret[i-2]+nums[i]):nums[i], i>=1?ret[i-1]:0);             ret.push_back(m);             if (m > mm)             {                 mm = m;             }         }         return mm;     }  ...

gpg生成公钥私钥 在maven里添加 < servers > < server > < id > sonatype-nexus-snapshots </ id > < username > Sonatype网站的账号 </ username > < password > Sonatype网站的密码 </ password > </ server > < server > < id > sonatype-nexus-staging </ id > < username > Sonatype网站的账号 </ username > < password > Sonatype网站的密码 </ password > </ server > </ servers > 执行mvn clean deploy -P sonatype-oss-release 登录https://oss.sonatype.org/#stagingRepositories

sudo GOARCH=mips GOOS=linux go build

Make sure /etc/rc.local is executable and that the script it calls is also executable. $ ls -l /etc/rc.local -rwxr-xr-x 1 root root 419 2010-08-27 11:26 /etc/rc.local   Make sure rc.local has a shebang line (which is the default): $ head -n1 /etc/rc.local #!/bin/sh -e

rpm -ivh https://dl.fedoraproject.org/pub/epel/epel-release-latest-7.noarch.rpm 下载好 teamviewer.x86_64.rpm 然后 yum install teamviewer.x86_64.rpm --enablerepo=epel-testing

\"(\\"|[^\"])*\"

class Solution { public:     int longestConsecutive(vector<int>& nums) {         map<int,int> tmp;         int max = 0;         for (int i = 0; i < nums.size(); i++)         {             if (tmp.find(nums[i]) == tmp.end())             {                 int l = tmp.find(nums[i]-1) != tmp.end()?tmp[nums[i]-1]:0;                 int r = tmp.find(nums[i]+1) != tmp.end()?tmp[nums[i]+1]:0;                 int n = l+r+1;             ...

class Solution { public:     void wiggleSort(vector<int>& nums) {                 if (nums.size() <= 1)         {             return;         }         sort(nums.begin(), nums.end());         int right = nums.size() - 1;         int start = right / 2;         int left = start - 1;         vector<int> ret;         ret.push_back(nums[start]);         while (ret.size() < nums.size())         {             if (ret.size() < nums.siz...

class Solution { public:     string largestNumber(vector<int>& nums) {         std::sort(nums.begin(), nums.end(), [](int a, int b)         {             int a1 = a;             int n = 1;             long a2 = 10;             while (a1 >= 10)             {                 a1 /= 10;                 a2 *= 10;                 n++;             } ...

class Solution { public:     vector<pair<int, int>> getSkyline(vector<vector<int>>& buildings) {                priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> leftx;         for (int i = 0; i < buildings.size(); i++)         {             vector<int> b = buildings[i];             leftx.push(make_pair(b[0], i));         }         priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> rightx;         for (int i = 0; i < buildings.size(); i++)    ...

/**  * Definition for a binary tree node.  * struct TreeNode {  *     int val;  *     TreeNode *left;  *     TreeNode *right;  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}  * };  */ class Codec { public:     string itoa(long i)     {         char buff[100];         sprintf(buff, "%lld", i);         return buff;     }         // Encodes a tree to a single string.     string serialize(TreeNode* root) {         string ret = "";         if (root == 0)             return ret;                 stack<T...

class Solution { public:     int kthSmallest(vector<vector<int>>& matrix, int k) {         for (int i = 0; i < k-1; i++)         {             pop(matrix);         }         return matrix[0][0];     }             void swap(std::vector<std::vector<int>>& matrix, int i, int j, int ii, int jj)     {         int tmp = matrix[i][j];         matrix[i][j] = matrix[ii][jj];         matrix[ii][jj] = tmp;     }     void pop(std::vector<std::vector<int>>& matrix)     {      ...