数据结构作业2

cumt的作业仍然是一如既往的阴间啊家人们（>_<)

以下代码使用c++11+标准, 在g++编译环境下编译

第一题采用了经典的马拉车算法，属实是大炮轰蚊子了捏。

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
constexpr int MAXN = 1e6;
constexpr int MOD = 1e9 + 7;
int countSubstrings(string s) {
    string t = "$#";
    for (char& c : s) {
        t += c;
        t += '#';
    }
    int n = t.size();
    t += '!';
    //cout << t << ' '; 
    vector<int> f(n);
    int imax = 0, rmax = 0, ans = 0;
    for (int i = 1; i < n; i++) {
        f[i] = (i <= rmax) ? min(rmax - i + 1, f[2 * imax - i]) : 1;
        while (t[i - f[i]] == t[i + f[i]]) {
            f[i]++;
        }
        if (i + f[i] - 1 > rmax) {
            rmax = i + f[i] - 1;
            imax = i;
        }
        ans += (f[i] / 2);
    }
    return ans;
}
int main() {
    //ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    string s;
    while (getline(cin, s)) {
        cout << countSubstrings(s) << endl;
    }   
    return 0;
}

第二题过于偌纸

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
constexpr int MAXN = 1e6;
constexpr int MOD = 1e9 + 7;
    
int main() {
    //ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int val;
    while (n--) {
        cin >> val;
        for (int i = 1; i <= val; i++) {
            for (int j = 1; j <= val; j++) {
                cout << i * j << ' '; 
            }
            cout << endl;
        }
    }   
    return 0;
}

第三题纯阴间模拟题

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
constexpr int MAXN = 1e6;
constexpr int MOD = 1e9 + 7;
int main() {
    int a, b, c, d, e;
    while (cin >> a >> b >> c >> d >> e && (a || b || c || d || e))
    {
        int f, g, h, i, j;
        if (b - a == c - b && c - b == d - c && d - c == e - d) 
        {
            int d1 = b - a;
            f = e + d1;
            g = f + d1;
            h = g + d1;
            i = h + d1;
            j = i + d1;
        }
        else if ((double)b / a == (double)c / b && (double)c / b == (double)d / c && (double)d / c == (double)e / d) {
            double q1 = (double)b / a;
            f = e * q1;
            g = f * q1;
            h = g * q1;
            i = h * q1;
            j = i * q1;
        }
        else if (a + b == c && b + c == d && c + d == e) {
            f = d + e;
            g = e + f;
            h = f + g;
            i = g + h;
            j = h + i;
        }
        cout << f << " " << g << " " << h << " " << i << " " << j << endl;
    }
    return 0;
}

第四五题为二叉树模板题，主要运用序列性质和哈希表

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
constexpr int MAXN = 1e6;
constexpr int MOD = 1e9 + 7;
struct TreeNode{
    TreeNode* left;
    TreeNode* right;
    char val;
    TreeNode(char val) {
        this->val = val;
    }
};
class Solution {
public:
    int index = 0;
    unordered_map<int, int> preVal_to_inIndex;
    TreeNode* buildTree(string& preorder,string& inorder,int left,int right) {
        if (left > right) return nullptr;
        TreeNode* root = new TreeNode(preorder[index]);
        int cur = preVal_to_inIndex[preorder[index]];
        index++;
        root->left = buildTree(preorder, inorder, left, cur - 1);
        root->right = buildTree(preorder, inorder, cur + 1, right);
        return root;
    }
    TreeNode* buildTree(string& preorder, string& inorder) {
        for (int i = 0; i < inorder.size(); i++) {
            preVal_to_inIndex[inorder[i]] = i;
        }
        return buildTree(preorder, inorder, 0, preorder.size() - 1);
    }
    void print(TreeNode* root) {
        if (root == nullptr) return;
        print(root->left);
        print(root->right);
        cout << root->val;
    }
};
int main() {
    //ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    string s1, s2;
    while (cin >> s1 >> s2) {
        Solution SL1;
        TreeNode* root = SL1.buildTree(s1, s2);
        SL1.print(root);
        cout << endl;
    }    
    return 0;
}

实际上第五题只需要稍微改一点（）

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
constexpr int MAXN = 1e6;
constexpr int MOD = 1e9 + 7;
struct TreeNode{
    TreeNode* left;
    TreeNode* right;
    char val;
    TreeNode(char val) {
        this->val = val;
    }
};
class Solution {
public:
    int index;
    unordered_map<char, int> m;
    TreeNode* buildTree(string& inorder, string& postorder, int left, int right) {
        if (left > right) return nullptr;
        int val = postorder[index]; 
        int curindex = m[postorder[index]];
        index--;
        auto root = new TreeNode(val);
        root->right = buildTree(inorder, postorder, curindex + 1, right);
        root->left = buildTree(inorder, postorder, left, curindex - 1);
        return root;
    }
    TreeNode* buildTree(string& inorder, string& postorder) {
        for (int i = 0; i < inorder.size(); i++) {
            m[inorder[i]] = i;
        }
        index = postorder.size() - 1;
        return buildTree(inorder, postorder, 0, inorder.size() - 1);
    }
    void print(TreeNode* root) {
        if (root == nullptr) return;
        print(root->left);    
        print(root->right);
        cout << root->val;
    }
};

int main() {
    //ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    string s1, s2, s3;
    Solution sl1;
    cin >> s1 >> s2 >> s3;
    TreeNode* root = sl1.buildTree(s1, s2); 
    if (s3 == "R") {
        sl1.print(root->right);
    }
    else {
        sl1.print(root->left);
    }
    return 0;
}

第六题采用队列bfs，注意入队条件即可

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
constexpr int MAXN = 1e6;
constexpr int MOD = 1e9 + 7;
const vector<int> dx = {-1, 1, 0, 0}; 
const vector<int> dy = {0, 0, -1, 1};
int shortestPath(int n, int m, vector<vector<char>>& grid, int sx, int sy) {
    vector<vector<bool>> visited(n, vector<bool>(m, false));  
    queue<tiii> q;
    q.emplace(sx, sy, 0);
    while (!q.empty()) {
        int x, y, dist;
        tie(x, y, dist) = q.front();
        q.pop();
        if (grid[x][y] == 'E') return dist;
        for (int i = 0; i < 4; i++) { 
            int nx = x + dx[i];
            int ny = y + dy[i];
            if (nx >= 0 && nx < n && ny >= 0 && ny < m && (grid[nx][ny] == '-' or grid[nx][ny] == 'E') && !visited[nx][ny]) {
                q.emplace(nx, ny, dist + 1);
                visited[nx][ny] = true;
            }
        }
    }
    return -1;
}
int main() {
    int T;
    cin >> T;
    while (T--) {
        int n, m;
        cin >> n >> m;
        vector<vector<char>> grid(n, vector<char>(m));
        int sx, sy;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cin >> grid[i][j];
                if (grid[i][j] == 'S') {
                    sx = i;
                    sy = j;
                } 
            }
        }
        int shortestDist = shortestPath(n, m, grid, sx, sy);
        cout << shortestDist << endl;
    }
    return 0;
}