Leetcode Day13

151. 颠倒字符串中的单词【中等】https://leetcode-cn.com/problems/reverse-words-in-a-string/

void reverse(char* s, int start, int end) {
    while (start < end) {
        char temp = s[start];
        s[start++] = s[end];
        s[end--] = temp;
    }
}

char * reverseWords(char * s){
   
    int len = strlen(s);
    int fast = 0, slow = 0;
    
    while (s[fast] == ' ') {
        fast++;
    }
    
    while (fast < len - 1) {
        if (s[fast] == ' ' && s[fast + 1] == ' ') {
            fast++;
        } else {
            s[slow++] = s[fast++];
        }
    }

    if (s[fast] == ' ') {
        s[slow] = '\0';
    } else {
        s[slow++] = s[fast];
        s[slow] = '\0';
    }
    
    reverse(s, 0, slow - 1);

    for (int i = 0; i < slow; i++) {
        int j = i;
        while (j < slow && s[j] != ' ') {
            j++;
        }
        reverse(s, i, j - 1);
        i = j;
    }

    return s;
}

93. 复原 IP 地址【中等】https://leetcode-cn.com/problems/restore-ip-addresses/

class Solution {
public:
    vector<string> res;
    vector<string> restoreIpAddresses(string s) {
        int n = s.size();
        string cur = s;
        helper(n,0,-1,cur,s);
        return res;
    }
    void helper(int n,int pointnum,int lastpoint,string& cur,string& s) {
        //pointnum记录目前加了几个点了，lastpoint记录上一个点加的位置
        if (pointnum == 3) {
        //如果已经加了三个点了，并且最后一个点的右边表示的数小于255，则是正确IP地址
            if (valid(lastpoint + 1,n-1,s)){
                res.push_back(cur);
            }
            return;
        }
        //从上一个.号的下一个位置开始查找
        for (int i = lastpoint + 1;i < n - 1;i++) {
            //如果字符串s从上一个.号到i位置表示的数小于等于255，则符合条件
            if (valid(lastpoint + 1,i,s)){
                //正常回溯法，注意这里要+pointnum，因为已经加入的.号也会占位
                cur.insert(cur.begin() + i + pointnum + 1,'.');
                helper(n,pointnum + 1,i,cur,s);
                cur.erase(pointnum + i + 1,1);
            }
        }
        return;
    }
    bool valid(int left,int right,string& s) {
        int sum = 0;
        for (int i = left ;i <= right; i++) {
            //处理0开头问题
            if (left != right and s[left] == '0' ) return false;
            //计算字符串s中left到right位表示的数的大小
            sum = sum *10 + (s[i] - '0');
            if (sum > 255) return false;
        }
        return true;
    }
};

105. 从前序与中序遍历序列构造二叉树【中等】https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/

class Solution {
public:

    unordered_map<int,int> pos;
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        int n = preorder.size();
        for(int i = 0; i < n; i++)
            pos[inorder[i]] = i; 
        return dfs(preorder,inorder,0,n-1,0,n-1);        
    }
    TreeNode* dfs(vector<int>&pre,vector<int>&in,int pl,int pr,int il,int ir)
    {
        if(pl > pr || il > ir)  return NULL; 
        int k = pos[pre[pl]] - il; 
        TreeNode* root = new TreeNode(pre[pl]);
        root->left = dfs(pre,in,pl+1,pl+k,il,il+k-1);  
        root->right = dfs(pre,in,pl+k+1,pr,il+k+1,ir); 
        return root;
    }
};

104. 二叉树的最大深度【简单】https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(root==nullptr)
            return 0;
        return max(maxDepth(root->left)+1,maxDepth(root->right)+1);
    }
};