Skip to main content

Backtracking - Question 1

Leetcode 51. N-Queens

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.

Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order.

Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.

Constraints:

1 <= n <= 9


Analysis:

For each row, we can only put one queen, so we can make the trial row by row.

For each row, every position is possible to place the queen. Once the queen is set, the position should be recorded, since this information has limitations on new queen's position.

To simply the record and also the check, we can use a one dimensional array for this: the index is for the row, and its value for the column. Both information determines the position of the queen placed.

Once reached the last row, we can check how many queens have been placed. 

If it equals to n, it means that we find a valid solution; 

If not, we need to go back the trial step, reset the trial, and make a second trial, ... until make and finish all the trials.


See the code below:


class Solution {
public:
    vector<vector<string>> solveNQueens(int n) {
        m = n;
        ps.resize(m);
        fill(ps.begin(), ps.end(), -1);
        bt(0, 0);// row number, queen counts
        return res;
    }
private:
    int m;
    vector<vector<string>> res;
    vector<string> one;
    vector<int> ps;
    void bt(int x, int ct) {
        if(x==m) {
            if(ct==m) res.push_back(one);
            return;
        }
        string s(m, '.');
        for(int i=0; i<m; ++i) {
            // if(ps[x] != -1) continue;
            s[i] = 'Q';// make trial
            if(isValid(x, i)) {
                ps[x] = i;//record
                one.push_back(s);//save
                bt(x+1, ct+1);
                one.pop_back();//step back
                ps[x] = -1;//step back
            }
            s[i] = '.';// reset
        }
    }
    bool isValid(int x, int y) {
        for(int i=0; i<m; ++i) {
            if(i == x || ps[i] == -1) continue;
            if(y == ps[i] || abs(x-i) == abs(y-ps[i])) return false;
        }
        return true;
    }
};

 

Upper Layer

Comments

Popular posts from this blog

Brute Force - Question 2

2105. Watering Plants II Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters the plants in order from right to left, starting from the (n - 1)th plant. They begin watering the plants simultaneously. It takes the same amount of time to water each plant regardless of how much water it needs. Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant. In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice ...

Sweep Line

Sweep (or scanning) line algorithm is very efficient for some specific questions involving discrete intervals. The intervals could be the lasting time of events, or the width of a building or an abstract square, etc. In the scanning line algorithm, we usually need to distinguish the start and the end of an interval. After the labeling of the starts and ends, we can sort them together based on the values of the starts and ends. Thus, if there are N intervals in total, we will have 2*N data points (since each interval will contribute 2). The sorting becomes the most time-consuming step, which is O(2N*log(2N) ~ O(N*logN). After the sorting, we usually can run a linear sweep for all the data points. If the data point is labeled as a starting point, it means a new interval is in the processing; when an ending time is reached, it means one of the interval has ended. In such direct way, we can easily figure out how many intervals are in the processes. Other related information can also be obt...

Dynamic Programming - Easy Level - Question 1

Dynamic Programming - Easy Level - Question 1 Leetcode 1646  Get Maximum in Generated Array You are given an integer n. An array nums of length n + 1 is generated in the following way: nums[0] = 0 nums[1] = 1 nums[2 * i] = nums[i] when 2 <= 2 * i <= n nums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n Return the maximum integer in the array nums​​​. Constraints: 0 <= n <= 100 Analysis: This question is quick straightforward: the state and transitional formula are given; the initialization is also given. So we can just ready the code to iterate all the states and find the maximum. See the code below: class Solution { public: int getMaximumGenerated(int n) { int res = 0; if(n<2) return n; vector<int> f(n+1, 0); f[1] = 1; for(int i=2; i<=n; ++i) { if(i&1) f[i] = f[i/2] + f[i/2+1]; else f[i] = f[i/2]; // cout<<i<<" "<<f[i]<<endl; ...