Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8936989
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 15, 20262026-06-15T10:19:52+00:00 2026-06-15T10:19:52+00:00

queue < int* > qq; for (int i = 0; i < N; i++)

  • 0
queue < int* > qq;

for (int i = 0; i < N; i++) {
    int cc[2] = {i, i + 1};
    qq.push(cc);
}

The N is large but not Exact so I want use queue.
I want to store many arrays to queue,but the arrays which qq stored are the same one.
How can I do it?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-15T10:19:53+00:00Added an answer on June 15, 2026 at 10:19 am

    Your code won’t work. Each cc has the same stack location in the loop.

    You need to allocate the cc array in the heap, perhaps using int *cc = new int[2]; (but then you need to delete it later).

    A better way would be to have cc declared as a std::vector or std::array or std::tuple (in C++11).

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have declared: queue<int, list<int> > Q After a series of calls: Q.push(37); Q.pop();
I have two tables which looks something like this Table Queue int ID; string
I'm trying to store the size of a queue in an int in C++.
I'd like to use std::copy to insert elements into a queue like this: vector<int>
I'm trying to tempalitize a linkedlist(/stack/queue) to accept int and double. But so far
I have queue from struct type struct test { int numbers; }; queue<test> q;
I've got a queue (actually 3 different queues but I don't believe that will
I am trying to add a user-defined plane object to a priority queue: int
#include <iostream> #include <queue> using namespace std; struct Call { Call( int callNum, long
I am attempting to push updates into a process via a named pipe, but

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.