C++中代码性能问题及解决方案的介绍

for (int i = 0; i < n; i++) {
    int result = heavyComputation(); // 复杂计算
    // 使用 result 进行后续操作
}

class ObjectPool {
public:
    Object* acquireObject() {
        if (m_pool.empty()) {
            return new Object();
        } else {
            Object* obj = m_pool.top();
            m_pool.pop();
            return obj;
        }
    }

    void releaseObject(Object* obj) {
        m_pool.push(obj);
    }

private:
    std::stack<Object*> m_pool;
};

class Object {
public:
    Object(Object&& other) noexcept {
        // 移动资源
    }

    Object& operator=(Object&& other) noexcept {
        if (this != &other) {
            // 移动资源
        }
        return *this;
    }

private:
    // 资源
};

int binarySearch(const std::vector<int>& nums, int target) {
    int left = 0;
    int right = nums.size() - 1;
    while (left <= right) {
        int mid = (left + right) / 2;
        if (nums[mid] == target) {
            return mid;
        } else if (nums[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    return -1;
}

void parallelProcess(std::vector<int>& nums) {
    std::vector<std::thread> threads;
    int numThreads = std::thread::hardware_concurrency();
    int chunkSize = nums.size() / numThreads;
    for (int i = 0; i < numThreads; i++) {
        int start = i * chunkSize;
        int end = (i == numThreads - 1) ? nums.size() : start + chunkSize;
        threads.push_back(std::thread(processChunk, std::ref(nums), start, end));
    }
    for (auto& thread : threads) {
        thread.join();
    }
}

void processChunk(std::vector<int>& nums, int start, int end) {
    // 处理子任务
}