We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. C++
  3. Introduction
  4. Arrays Introduction
  5. Discussions

Arrays Introduction

Sort 679 Discussions, By:

votes

  • JChiquin + 0 comments

    My solution without using vector:

    #include <iostream>
int main() {
    int N,i=0;
    std::cin>>N;
    int *A = new int[N];
    while(std::cin>>A[i++]);
    while(std::cout<<A[--N]<<' ' && N);
    delete[] A;
    return 0;
}

  • mpatriak + 0 comments

    My C++ Solution

        int numElements;
    cin >> numElements;
    int arr[numElements];
    for (int i = 0; i < numElements; i++)
        cin >> arr[i];
    for (int i = numElements - 1; i >= 0; i--)
        cout << arr[i] << " ";
    return 0;

  • scott_spillmann + 0 comments

    Beware coders, g++ (likely the compiler being used here) allows variable length arrays. However, if you compile using g++ -pedantic, it will not compile because ISO C++ forbids variable length arrays. Typically array length is specified at compile time. This is a g++ extension to the language vs standard c++.

    There is a solution using std::vector (std::vector allows run-time dynamic array length)

    http://en.cppreference.com/w/cpp/container/vector

  • Ethan13310 + 0 comments

    We don't want to use C-style array in C++. We use STL containers instead, which have a lot of advantages such as being compatible with STL algorithms, or providing useful member functions such as 'std::vector::size()' (to get the size of the array :D). In this case, we can use 'std::vector', which is a dynamic array. Here's the solution in true C++:

    #include <vector>
#include <iostream>
#include <iterator>

int main()
{
    std::size_t size{}; // Here we use 'std::size_t' instead of 'int'
                        // because an array size cannot be negative
    std::cin >> size;
    std::vector<int> vect(size);
    for (std::size_t i{}; i < size; ++i)
    	std::cin >> vect[i];

    // One of the many advantages to use C++ STL containers:
    // we can use reverse iterators
    for (auto rit = vect.rbegin(); rit != vect.rend(); ++rit)
        std::cout << *rit << ' ';
    std::cout << std::endl;
    return 0;
}

  • abinayavasan + 0 comments

    int main() {

    cin>>n;
int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=n-1;i>=0;i--)
{
    cout<<a[i]<<" ";
}

    }

Load more conversations