武大计算机考研机试真题权威解析与备考指南｜系统掌握算法、数据结构与编程规范

// 题目：实现首次适应算法（First Fit）
// 要求：支持分配/释放操作，返回空闲块起始地址
struct MemoryBlock {
    int start;
    int size;
    bool is_free;
};
class MemoryManager {
private:
    vector blocks;
public:
    MemoryManager(int total_size) {
        blocks.push_back({0, total_size, true});
    }
    int allocate(int size) {
        for (auto& block : blocks) {
            if (block.is_free && block.size >= size) {
                int addr = block.start;
                if (block.size > size) {
                    blocks.insert(blocks.begin() + (&block 
- &blocks[0]) + 1,
                                  {addr + size, block.size 
- size, true});
                    block.size = size;
                }
                block.is_free = false;
                return addr;
            }
        }
        return -1; // 分配失败
    }
    void deallocate(int addr) {
        for (auto& block : blocks) {
            if (block.start == addr && !block.is_free) {
                block.is_free = true;
                // 合并相邻空闲块
                merge_adjacent();
                return;
            }
        }
    }
private:
    void merge_adjacent() {
        for (int i = 0; i < blocks.size() 
- 1; ) {
            if (blocks[i].is_free && blocks[i+1].is_free &&
                blocks[i].start + blocks[i].size == blocks[i+1].start) {
                blocks[i].size += blocks[i+1].size;
                blocks.erase(blocks.begin() + i + 1);
            } else {
                i++;
            }
        }
    }
};

// 题目：查询每个部门工资排名前三的员工
// 表结构：employees(id, name, salary, dept_id)
SELECT d.name AS department, e.name, e.salary
FROM employees e
JOIN departments d ON e.dept_id = d.id
WHERE (
    SELECT COUNT(DISTINCT e2.salary)
    FROM employees e2
    WHERE e2.dept_id = e.dept_id AND e2.salary >= e.salary
) <= 3
ORDER BY d.name, e.salary DESC;

// 题目：解析Nginx访问日志，统计TOP10 IP
// 输入：access.log（每行格式：IP 
- 
- [时间] "请求" 状态码 字节数）
#include 
#include