Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Array.h #ifndef ARRAY_H #define ARRAY_H #include #include #include #include Iterator.h namespace ds { namespace it { template class Iterator : public IteratorInterface { private: T*
Array.h
#ifndef ARRAY_H | |
#define ARRAY_H | |
#include | |
#include | |
#include | |
#include "Iterator.h" | |
namespace ds | |
{ | |
namespace it | |
{ | |
template | |
class Iterator : public IteratorInterface | |
{ | |
private: | |
T* data; | |
int cnt; | |
int capacity; | |
public: | |
Iterator() : Iterator(NULL,0) {} | |
Iterator(T* data,int capacity) : data(data), capacity(capacity), cnt(0) | |
{ | |
if(this->capacity | |
{ | |
this->capacity = 0; | |
} | |
} | |
bool HasNext() const | |
{ | |
return (cnt | |
} | |
T& Next() | |
{ | |
int c = cnt; | |
cnt += 1; | |
return data[c]; | |
} | |
}; | |
} | |
template | |
class Array | |
{ | |
private: | |
T* data; | |
int capacity; | |
public: | |
Array() : Array(100) {} | |
Array(int capacity) : capacity(capacity) | |
{ | |
if(this->capacity | |
{ | |
this->capacity = 100; | |
} | |
data = new T[this->capacity]; | |
for(int i = 0;i capacity;i += 1) | |
{ | |
data[i] = T(); | |
} | |
} | |
Array(const Array | |
{ | |
/*Deep Copy*/ | |
capacity = obj.capacity; | |
data = new T[capacity]; | |
for(int i = 0;i | |
{ | |
data[i] = obj.data[i]; | |
} | |
} | |
Array | |
{ | |
if(this != &rhs) | |
{ | |
capacity = rhs.capacity; | |
delete[] data; | |
data = new T[capacity]; | |
for(int i = 0;i | |
{ | |
data[i] = rhs.data[i]; | |
} | |
} | |
return *this; | |
} | |
~Array() {delete[] data;} | |
const T& operator[](int idx) const | |
{ | |
if(idx = capacity) | |
{ | |
throw "Out of bound"; | |
} | |
return data[idx]; | |
} | |
T& operator[](int idx) | |
{ | |
if(idx = capacity) | |
{ | |
throw "Out of bound"; | |
} | |
return data[idx]; | |
} | |
int Length() const {return capacity;} | |
std::string ToString() const | |
{ | |
std::stringstream out; | |
out | |
for(int i = 0;i | |
{ | |
out | |
if(i + 1 | |
{ | |
out | |
} | |
} | |
out | |
return out.str(); | |
} | |
it::Iterator | |
{ | |
return new it::Iterator | |
} | |
friend std::ostream& operator& obj) | |
{ | |
out | |
return out; | |
} | |
}; | |
} | |
#endif |
C++ programming
For this lab, your objective is to define functions that solve each array problem. You may only use the Array class from the lecture. Yo Given an array of integers and a target value, find two elements of the array that sums to the target. If the elements exist, display their indices and return true; otherwise, return false. The elements must be different. without rising another Given an array, num, and value, wil remove all instances of val from array. Furthermore, return the new length of the array, Given a sorted array and a target value return the index of the target if it is found; otherwise return the index where it would be if it were inserted in order. There may be duplicates. templateStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started