Leetcode 22. 括号生成（DAY 85） ---- Leetcode Hot 100

---

原题题目

---

---

代码实现（首刷自解）

---

class Solution {
public:

    vector<string> ret;

    void backtracking(int pretimes,int behindtimes,int n,string temp,stack<char> & s)
    {
        if(pretimes > n || behindtimes > n) return;
        if(pretimes == n && behindtimes == n)
        {
            if(s.empty()) ret.push_back(temp);
            return;
        }

        s.push('(');
        backtracking(pretimes+1,behindtimes,n,temp+'(',s);
        s.pop();
        if(!s.empty() && s.top() == '(')
        {
            s.pop();
            backtracking(pretimes,behindtimes+1,n,temp+')',s);
            s.push('(');
        }
    }

    vector<string> generateParenthesis(int n) {
        string temp;
        stack<char> s;
        backtracking(0,0,n,temp,s);
        return ret;
    }
};

---

代码实现（二刷自解C++）

---

class Solution {
public:
    void backtracking(vector<string>& ret,string str,int n,int left,int right,int pos)
    {
        if(pos == n+n && left == right)  ret.emplace_back(str);
        if(left < n)
        {
            str += '(';
            backtracking(ret,str,n,left+1,right,pos+1);
            str.pop_back();
        }
        if(right < left)
        {
            str += ')';
            backtracking(ret,str,n,left,right+1,pos+1);
            str.pop_back();
        }
        return;
    }

    vector<string> generateParenthesis(int n) {
        vector<string> ret;
        string str;
        backtracking(ret,str,n,0,0,0);
        return ret;
    }
};

---

代码实现（三刷自解 DAY 244 C++）

---

class Solution {
public:
    void backtracking(vector<string>& ret,string& str,int n,int left,int right)
    {
        if(left > n || right > left)
            return;

        if(left == n && left == right)
        {
            ret.emplace_back(str);
            return;
        }
        
        str += '(';
        backtracking(ret,str,n,left + 1,right);
        str.pop_back();

        str += ')';
        backtracking(ret,str,n,left,right + 1);
        str.pop_back();
    }

    vector<string> generateParenthesis(int n) {
        vector<string> ret;
        string str;

        backtracking(ret,str,n,0,0);

        return ret;
    }
};

---

代码实现（四刷自解 DAY 281 C++）

---

class Solution {
 public:
  void BackTracking(vector<string>& ret, string& tmp, const int n, int left, int right) {
    if (left > n || right > left) return;
    if (n == left && left == right) {
      ret.emplace_back(tmp);
      return;
    }

    tmp += '(';
    BackTracking(ret, tmp, n, left + 1, right);
    tmp.pop_back();

    if (left > right) {
      tmp += ')';
      BackTracking(ret, tmp, n, left, right + 1);
      tmp.pop_back();
    }
    return;
  }

  vector<string> generateParenthesis(int n) {
    vector<string> ret;
    string str;
    BackTracking(ret, str, n, 0, 0);

    return ret;
  }
};

---

代码实现（五刷自解 DAY 5 Golang）

---

var ret []string

func Backtracking(tmp []byte, n, left, right int) {
  if right > left || left > n {
    return
  }

  if left == n && right == left {
    ret = append(ret, string(tmp))
    return
  }

  tmp = append(tmp, '(')
  Backtracking(tmp, n, left + 1, right)
  tmp = tmp[:len(tmp) - 1]

  if left > right {
    tmp = append(tmp, ')')
    Backtracking(tmp, n, left, right + 1)
    tmp = tmp[:len(tmp) - 1]
  }
}

func generateParenthesis(n int) []string {
  tmp := []byte{}
  Backtracking(tmp, n, 0, 0)
  
  tmpcopy := []string{}
  tmpcopy, ret = ret, tmpcopy

  return tmpcopy
}