代码诗人养成记：在算法的世界里写下第一行诗，新手量身定制行动指南

#include <iostream>
#include <vector>
#include <map>

int main() {
    std::vector<int> nums = {1, 2, 3, 4, 5};
    std::map<std::string, int> scores;

    scores["Alice"] = 90;
    scores["Bob"] = 85;

    for (int num : nums) {
        std::cout << num << " ";
    }
    std::cout << std::endl;

    for (const auto& pair : scores) {
        std::cout << pair.first << ": " << pair.second << std::endl;
    }

    return 0;
}

#include <iostream>
#include <vector>

void quickSort(std::vector<int>& arr, int left, int right) {
    if (left >= right) return;

    int pivot = arr[(left + right) / 2];
    int i = left, j = right;

    while (i <= j) {
        while (arr[i] < pivot) i++;
        while (arr[j] > pivot) j--;
        if (i <= j) {
            std::swap(arr[i], arr[j]);
            i++;
            j--;
        }
    }

    quickSort(arr, left, j);
    quickSort(arr, i, right);
}

int main() {
    std::vector<int> nums = {5, 3, 8, 6, 7, 2};
    quickSort(nums, 0, nums.size() - 1);

    for (int num : nums) {
        std::cout << num << " ";
    }
    std::cout << std::endl;

    return 0;
}

#include <iostream>
#include <vector>
#include <string>

using namespace std;

int lcs(string s1, string s2) {
    int m = s1.size(), n = s2.size();
    vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));

    for (int i = 1; i <= m; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (s1[i - 1] == s2[j - 1])
                dp[i][j] = dp[i - 1][j - 1] + 1;
            else
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
        }
    }

    return dp[m][n];
}

int main() {
    string s1 = "abcde", s2 = "ace";
    cout << "LCS Length: " << lcs(s1, s2) << endl;
    return 0;
}

#include <iostream>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

typedef pair<int, int> pii;

void dijkstra(int start, vector<vector<pii>>& graph, vector<int>& dist) {
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    dist[start] = 0;
    pq.push({0, start});

    while (!pq.empty()) {
        int u = pq.top().second;
        int d = pq.top().first;
        pq.pop();

        if (d > dist[u]) continue;

        for (auto edge : graph[u]) {
            int v = edge.first;
            int weight = edge.second;

            if (dist[v] > dist[u] + weight) {
                dist[v] = dist[u] + weight;
                pq.push({dist[v], v});
            }
        }
    }
}

int main() {
    int n = 5; // number of nodes
    vector<vector<pii>> graph(n);

    // Add edges
    graph[0].push_back({1, 10});
    graph[0].push_back({3, 5});
    graph[1].push_back({2, 1});
    graph[1].push_back({3, 2});
    graph[2].push_back({4, 4});
    graph[3].push_back({1, 3});
    graph[3].push_back({4, 9});
    graph[4].push_back({0, 7});
    graph[4].push_back({2, 6});

    vector<int> dist(n, INT_MAX);
    dijkstra(0, graph, dist);

    for (int i = 0; i < n; ++i) {
        cout << "Distance from node 0 to node " << i << " is " << dist[i] << endl;
    }

    return 0;
}