Trạng thái Đã xong

Bắt đầu vào lúc Thứ Tư, 18 tháng 9 2024, 4:19 PM

Kết thúc lúc Thứ Sáu, 20 tháng 9 2024, 9:27 PM
Thời gian thực 2 Các ngày 5 giờ
hiện
Điểm 7,00/7,00
Điểm 10,00 trên 10,00 (100%)


Câu hỏi 1
Đúng

Đạt điểm 1,00 trên 1,00

Implement methods ensureCapacity, add, size in template class ArrayList representing the array list with type T with the
initialized frame. The description of each method is given in the code.
template <class T>
class ArrayList {
protected:
T* data; // dynamic array to store the list's items
int capacity; // size of the dynamic array
int count; // number of items stored in the array
public:
ArrayList(){capacity = 5; count = 0; data = new T[5];}

~ArrayList(){ delete[] data; }

void add(T e);
void add(int index, T e);
int size();
void ensureCapacity(int index);
};

For example:

Test Result

ArrayList<int> arr; [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

int size = 10; 10

for(int index = 0; index < size; index++){

arr.add(index);
}

cout << arr.toString() << '\n';

cout << arr.size();

ArrayList<int> arr; [19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
int size = 20; 20

for(int index = 0; index < size; index++){

arr.add(0, index);
}

cout << arr.toString() << '\n';

cout << arr.size() << '\n';
arr.ensureCapacity(5);

Answer: (penalty regime: 0, 0, 0, 0, 0, 100 %)

Reset answer

1 template<class T>
2 ▼ void ArrayList<T>::ensureCapacity(int cap){
3 ▼ /*
4 if cap > capacity:
5 new_capacity = capacity * 1.5;
6 create new array with new_capacity
7 else: do nothing
8 */
9
10 ▼ if (cap > capacity) { 
11 int newCapacity = capacity * 1.5;
12 ▼ try {
13 T* newData = new T[newCapacity];
14
15 ▼ for (int i = 0; i < count; ++i) {
16 newData[i] = data[i];
17 }
18
 18
19 delete[] data;
20 data = newData;
21 capacity = newCapacity;
22 }
23 ▼ catch (std::bad_alloc& e) {
24 throw;
25 }
26 }
27 }
28
29 template <class T>
30 ▼ void ArrayList<T>::add(T e) {
31 ensureCapacity(count + 1);
32 data[count] = e;
33 ++count;
34 }
35
36 template<class T>
37 ▼ void ArrayList<T>::add(int index, T e) {
38 ▼ /*
39 Insert an element into the array at given index.
40 if index is invalid:
41 throw std::out_of_range("the input index is out of range!");
42 */
43 ▼ if (index < 0 || index > count) {
44 throw std::out_of_range("the input index is out of range!");
45 }
46 ensureCapacity(count + 1);
47 ▼ for (int i = count; i > index; --i) {
48 data[i] = data[i - 1];
49 }
50 data[index] = e;
51 ++count;
52 }
53
54 template<class T>
55 ▼ int ArrayList<T>::size() {
56 /* Return the length (size) of the array */
57 return count;
58 }
59

Test Expected Got

 ArrayList<int> arr; [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] 

int size = 10; 10 10

for(int index = 0; index <

size; index++){
arr.add(index);
}

cout << arr.toString() << '\n';

cout << arr.size();

 ArrayList<int> arr; [19, 18, 17, 16, 15, 14, 13, 12, 11, [19, 18, 17, 16, 15, 14, 13, 12, 
int size = 20; 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0] 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1,
20 0]
for(int index = 0; index < 20
size; index++){
arr.add(0, index);
}

cout << arr.toString() << '\n';


cout << arr.size() << '\n';
arr.ensureCapacity(5);

Passed all tests! 

Đúng
Marks for this submission: 1,00/1,00.


Câu hỏi 2
Đúng

Đạt điểm 1,00 trên 1,00

Implement methods removeAt, removeItem, clear in template class ArrayList representing the singly linked list with type T
with the initialized frame. The description of each method is given in the code.
template <class T>
class ArrayList {

protected:
T* data; // dynamic array to store the list's items
int capacity; // size of the dynamic array
int count; // number of items stored in the array
public:
ArrayList(){capacity = 5; count = 0; data = new T[5];}
~ArrayList(){ delete[] data; }

void add(T e);

void add(int index, T e);
int size();
bool empty();
void clear();
T get(int index);
void set(int index, T e);
int indexOf(T item);
bool contains(T item);
T removeAt(int index);
bool removeItem(T item);

void ensureCapacity(int index);

};

For example:

Test Result

ArrayList<int> arr; [1, 2, 3, 4, 5, 6, 7, 8, 9]

9
for (int i = 0; i < 10; ++i) {
arr.add(i);
}
arr.removeAt(0);

cout << arr.toString() << '\n';

cout << arr.size();

ArrayList<int> arr; [0, 1, 2, 3, 4, 5, 6, 7, 8]

9
for (int i = 0; i < 10; ++i) {
arr.add(i);
}
arr.removeAt(9);

cout << arr.toString() << '\n';

cout << arr.size(); 
 Test Result

ArrayList<int> arr; [0, 1, 2, 3, 4, 6, 7, 8, 9]

9
for (int i = 0; i < 10; ++i) {
arr.add(i);
}
arr.removeAt(5);

cout << arr.toString() << '\n';

cout << arr.size();

Answer: (penalty regime: 0, 0, 0, 0, 0, 100 %)

Reset answer

1 template<class T>
2 ▼ T ArrayList<T>::removeAt(int index){
3 ▼ /*
4 Remove element at index and return removed value
5 if index is invalid:
6 throw std::out_of_range("index is out of range");
7 */
8 ▼ if (index < 0 || index >= count) {
9 throw std::out_of_range("index is out of range");
10 }
11 T removedItem = data[index];
12 ▼ for (int i = index; i < count - 1; i++) {
13 data[i] = data[i + 1];
14 }
15 --count;
16 T *newData = new T[capacity];
17 ▼ for (int i = 0; i < count; i++) {
18 newData[i] = data[i];
19 }
20 delete[] data;
21 data = newData;
22 return removedItem;
23
24 }
25
26 template<class T>
27 ▼ bool ArrayList<T>::removeItem(T item){
28 /* Remove the first apperance of item in array and return true, otherwise return false */
29
30 ▼ for (int i = 0; i < count; i++) {
31 ▼ if (data[i] == item) {
32 removeAt(i);
33 return true;
34 }
35 }
36 return false;
37 }
38
39 template<class T>
40 ▼ void ArrayList<T>::clear(){
41 ▼ /*
42 Delete array if array is not NULL
43 Create new array with: size = 0, capacity = 5
44 */
45 if(data != nullptr)
46 delete[] data;
47 data = nullptr;
48 count = 0;
49 capacity = 5;
50 data = new T[capacity];
51 }
52


 Test Expected Got

 ArrayList<int> arr; [1, 2, 3, 4, 5, 6, 7, 8, 9] [1, 2, 3, 4, 5, 6, 7, 8, 9] 

9 9
for (int i = 0; i < 10; ++i) {
arr.add(i);
}
arr.removeAt(0);

cout << arr.toString() << '\n';

cout << arr.size();

 ArrayList<int> arr; [0, 1, 2, 3, 4, 5, 6, 7, 8] [0, 1, 2, 3, 4, 5, 6, 7, 8] 

9 9
for (int i = 0; i < 10; ++i) {
arr.add(i);
}
arr.removeAt(9);

cout << arr.toString() << '\n';

cout << arr.size();

 ArrayList<int> arr; [0, 1, 2, 3, 4, 6, 7, 8, 9] [0, 1, 2, 3, 4, 6, 7, 8, 9] 

9 9
for (int i = 0; i < 10; ++i) {
arr.add(i);
}
arr.removeAt(5);

cout << arr.toString() << '\n';

cout << arr.size();

Passed all tests! 

Đúng
Marks for this submission: 1,00/1,00.


Câu hỏi 3
Đúng

Không chấm điểm

Implement methods Get, set, clear, empty, indexOf, contains in template class ArrayList representing the array list with type
T with the initialized frame. The description of each method is given in the code.
template <class T>
class ArrayList {
protected:
T* data; // dynamic array to store the list's items
int capacity; // size of the dynamic array
int count; // number of items stored in the array
public:

ArrayList(){capacity = 5; count = 0; data = new T[5];}

~ArrayList(){ delete[] data; }

void add(T e);

void add(int index, T e);
int size();
bool empty();
void clear(); //remove data and set the list to the initial condition
T get(int index); //get the element at the index, if the index is out of range, "throw std::out_of_range("index
is out of range");"

void set(int index, T e); //set the index position in the list with the value e
int indexOf(T item); //get the first index of item in the list, else return -1
bool contains(T item); //check if the item is in the list
T removeAt(int index);
bool removeItem(T item);

};

Notice: You just have to implement the methods: set, get, clear, empty, indexOf, contains. Other methods have been
implemented already.

For example:

Test Result

ArrayList<int> arr; [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

int size = 10; 100
for(int index = 0; index < size; index++){ [100, 1, 2, 3, 4, 5, 6, 7, 8, 9]
arr.add(index); []
} 1
cout << arr.toString() << '\n'; 7
arr.set(0,100); 0
cout << arr.get(0) << '\n';
cout << arr.toString() << '\n';
arr.clear();
cout << arr.toString() << '\n';
cout << arr.empty() << '\n';
for(int index = 0; index < size; index++){
arr.add(index);
}
cout << arr.indexOf(7) << '\n';
cout << arr.contains(15) << '\n';


Test Result

ArrayList<int> arr; Index is out of range

int size = 10;
for(int index = 0; index < size; index++){
arr.add(index);
}
try {
arr.set(10,100);
cout << arr.get(10) << '\n';
}
catch(const std::exception & e){
cout << e.what() << endl;
}

Answer:
1 template <class T>
2 int ArrayList<T>::indexOf(T item)
3 ▼ {
4 ▼ for (int i = 0; i < count; i++) {
5 ▼ if (data[i] == item) {
6 return i;
7 }
8 }
9 return -1;
10 }
11
12 template <class T>
13 T ArrayList<T>::get(int index)
14 ▼ {
15 ▼ if (index < 0 || index >= count) {
16 throw std::out_of_range("Index is out of range");
17 }
18 return data[index];
19 }
20
21 template <class T>
22 ▼ void ArrayList<T>::clear(){
23 ▼ /*
24 Delete array if array is not NULL
25 Create new array with: size = 0, capacity = 5
26 */
27 if(data != nullptr)
28 delete[] data;
29 data = nullptr;
30 count = 0;
31 capacity = 5;
32 data = new int[capacity];
33 }
34
35 template <class T>
36 bool ArrayList<T>::empty()
37 ▼ {
38 return count == 0;
39 }
40
41 template <class T>
42 bool ArrayList<T>::contains(T item)
43 ▼ {
44 return indexOf(item) != -1;
45 }
46
47 template <class T>
48 ▼ void ArrayList<T>::set(int index, T e){
49 data[index] = e;
50 }//set the index position in the list with the value e


 Test Expected Got

 ArrayList<int> arr; [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] 

int size = 10; 100 100
for(int index = 0; index < size; [100, 1, 2, 3, 4, 5, 6, 7, 8, [100, 1, 2, 3, 4, 5, 6, 7, 8,
index++){ 9] 9]
arr.add(index); [] []
} 1 1
cout << arr.toString() << '\n'; 7 7
arr.set(0,100); 0 0
cout << arr.get(0) << '\n';
cout << arr.toString() << '\n';
arr.clear();
cout << arr.toString() << '\n';
cout << arr.empty() << '\n';
for(int index = 0; index < size;
index++){
arr.add(index);
}
cout << arr.indexOf(7) << '\n';
cout << arr.contains(15) << '\n';

 ArrayList<int> arr; Index is out of range Index is out of range 

int size = 10;
for(int index = 0; index < size;
index++){
arr.add(index);
}
try {
arr.set(10,100);
cout << arr.get(10) << '\n';
}
catch(const std::exception & e){
cout << e.what() << endl;
}

Passed all tests! 


Câu hỏi 4
Đúng

Đạt điểm 1,00 trên 1,00

Given an array of integers nums and a two-dimension array of integers operations.

Each operation in operations is represented in the form {L, R, X}. When applying an operation, all elements with index in
range [L, R] (include L and R) increase by X.
Your task is to implement a function with following prototype:
vector<int> updateArrayPerRange(vector<int>& nums, vector<vector<int>>& operations);

The function returns the array after applying all operation in operations.

Note:
- The iostream, and vector libraries have been included and namespace std is being used. No other libraries are allowed.
- You can write helper functions.

For example:

Test Result

vector<int> nums {13, 0, 6, 9, 14, 16}; [21, 8, 14, 9, 14, 32]

vector<vector<int>> operations {{5, 5, 16}, {3, 4, 0}, {0, 2, 8}};
printVector(updateArrayPerRange(nums, operations));

Answer: (penalty regime: 0 %)

Reset answer

1
2 ▼ vector<int> updateArrayPerRange(vector<int>& nums, vector<vector<int>>& operations) {
3 ▼ for(const auto& operation : operations){
4 ▼ for(int j = operation[0]; j <= operation[1]; ++j){
5 nums[j] = nums[j] + operation[2];
6 }
7 }
8 return nums;
9 }

Test Expected Got

 vector<int> nums {13, 0, 6, 9, 14, 16}; [21, 8, 14, 9, 14, [21, 8, 14, 9, 
vector<vector<int>> operations {{5, 5, 16}, {3, 4, 0}, {0, 2, 8}}; 32] 14, 32]
printVector(updateArrayPerRange(nums, operations));

 vector<int> nums {19, 4, 3, 2, 16, 3, 17, 8, 18, 12}; [32, 28, 36, 41, [32, 28, 36, 
vector<vector<int>> operations {{0, 3, 4}, {2, 5, 12}, {3, 6, 6}, 51, 61, 36, 21, 31, 41, 51, 61, 36,
{5, 8, 5}, {8, 9, 8}, {0, 5, 9}, {1, 7, 8}, {1, 1, 3}, {5, 5, 18}}; 20] 21, 31, 20]
printVector(updateArrayPerRange(nums, operations)); 

Passed all tests! 

Đúng
Marks for this submission: 1,00/1,00.
Câu hỏi 5
Đúng

Đạt điểm 1,00 trên 1,00

Given an array of integers.

Your task is to implement a function with the following prototype:
bool consecutiveOnes(vector<int>& nums);

The function returns if all the 1s appear consecutively in nums. If nums does not contain any elements, please return true

Note:
- The iostream and vector libraries have been included and namespace std are being used. No other libraries are allowed.
- You can write helper functions.
- Do not use global variables in your code.

For example:

Test Result

vector<int> nums {0, 1, 1, 1, 9, 8}; 1

cout << consecutiveOnes(nums);

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ bool consecutiveOnes(vector<int>& nums) {

2 if(nums.empty()) return 1;
3 pair<bool, bool> a;
4 ▼ for(const auto& num : nums){
5 ▼ if(num == 1){
6 a.first = true;
7 }
8 ▼ if(a.first && num != 1) {
9 a.second = true;
10 }
11 if(a.second && a.first && num == 1) return 0;
12 }
13 return 1;
14 }

Test Expected Got

 vector<int> nums {0, 1, 1, 1, 9, 8}; 1 1 

cout << consecutiveOnes(nums);

 vector<int> nums {}; 1 1 

cout << consecutiveOnes(nums);

Passed all tests! 

Đúng
Marks for this submission: 1,00/1,00. 
Câu hỏi 6
Đúng

Đạt điểm 1,00 trên 1,00

The prices of all cars of a car shop have been saved as an array called N. Each element of the array N is the price of each
car in shop. A person, with the amount of money k want to buy as much cars as possible.

Request: Implement function

buyCar(int* nums, int length, int k);

Where nums is the array N, length is the size of this array and k is the amount of money the person has. Find the maximum
cars this person can buy with his money, and return that number.

Example:

nums=[90, 30, 20, 40, 50]; k=90;

The result is 3, he can buy the cars having index 1, 2, 3 (first index is 0).

Note: The library iostream, 'algorithm' and using namespace std have been used. You can add other functions but you are not
allowed to add other libraries.

For example:

Test Result

int nums[] = {90,30,40,90,20}; 3

int length = sizeof(nums)/sizeof(nums[0]);
cout << buyCar(nums, length, 90) << "\n";

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ int binarySearch(int a[], int x, int low, int high) {

2 if (high <= low) return (x > a[low]) ? (low + 1) : low;
3
4 int mid = (low + high) / 2;
5
6 if (x == a[mid]) return mid + 1;
7
8 if (x > a[mid]) return binarySearch(a, x, mid + 1, high);
9 return binarySearch(a, x, low, mid - 1);
10 }
11
12 ▼ void binarySort(int a[], int n) {
13 ▼ for (int i = 1; i < n; ++i) {
14 int j = i - 1;
15 int key = a[i];
16 int pos = binarySearch(a, key, 0, j);
17 ▼ while (j >= pos) {
18 a[j + 1] = a[j];
19 --j;
20 }
21 a[j + 1] = key;
22 }
23 }
24
25 ▼ int buyCar(int* nums, int length, int k) {
26 binarySort(nums, length);
27 int sum = 0;
28 ▼ for(int i = 0; i < length; ++i){
29 sum += nums[i];
30 ▼ if(sum > k){
31 return i;
32 }
33 } 
34 return length;
35 }
 Test Expected Got

 int nums[] = {90,30,40,90,20}; 3 3 

int length = sizeof(nums)/sizeof(nums[0]);
cout << buyCar(nums, length, 90) << "\n";

Passed all tests! 

Đúng
Marks for this submission: 1,00/1,00.


Câu hỏi 7
Đúng

Đạt điểm 1,00 trên 1,00

Given an array of integers.

Your task is to implement a function with following prototype:

int equalSumIndex(vector<int>& nums);

The function returns the smallest index i such that the sum of the numbers to the left of i is equal to the sum of the numbers
to the right.
If no such index exists, return -1.

Note:
- The iostream and vector libraries have been included and namespace std is being used. No other libraries are allowed.
- You can write helper functions.

For example:

Test Result

vector<int> nums {3, 5, 2, 7, 6, 4}; 3

cout << equalSumIndex(nums);

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ // int findindex(int l, int r, int f[], int n, vector<int> nums){

2 // if(l > r) return -1;
3 // int index = (r - l) / 2;
4 // int sum_l = f[index - 1],
5 // sum_r = f[n - 1] - sum_l - nums[index];
6 // if(sum_l == sum_r) return index;
7 // else if(sum_l > sum_r) return findindex(l, index - 1, f, n, nums);
8 // return findindex(index + 1, r, f, n, nums);
9 // }
10
11 ▼ int equalSumIndex(vector<int>& nums) {
12 int n = nums.size();
13 if(n == 1) return 0;
14 int f[n];
15 f[0] = nums[0];
16 ▼ for(int i = 1; i < n; ++i){
17 f[i] = f[i - 1] + nums[i];
18 }
19 // return findindex(0, n - 1, f, n, nums); if (num >= 0)
20 ▼ for(int i = 0; i < n; ++i){
21 if(f[i - 1] == f[n - 1] - f[i - 1] - nums[i])
22 return i;
23 }
24 return -1;
25 }

Test Expected Got

 vector<int> nums {3, 5, 2, 7, 6, 4}; 3 3 

cout << equalSumIndex(nums);

 vector<int> nums {3}; 0 0 

cout << equalSumIndex(nums);

Passed all tests! 

Đúng
Marks for this submission: 1,00/1,00.
Câu hỏi 8
Đúng

Đạt điểm 1,00 trên 1,00

Given an array of strings.

Your task is to implement a function with following prototype:

int longestSublist(vector<string>& words);

The function returns the length of the longest subarray where all words share the same first letter.

Note:
- The iostream and vector libraries have been included and namespace std is being used. No other libraries are allowed.
- You can write helper functions.

For example:

Test Result

vector<string> words {"faction", "fight", "and", "are", "attitude"}; 3

cout << longestSublist(words);

Answer: (penalty regime: 0 %)

Reset answer

1 ▼ int longestSublist(vector<string>& words) {

2 int n = words.size();
3 if(n == 0) return 0;
4 int f[n], ans = 1;
5 f[0] = 1;
6 ▼ for(int i = 1; i < n; ++i){
7 ▼ if(words[i][0] == words[i - 1][0]){
8 f[i] = f[i - 1] + 1;
9 ans = max(ans, f[i]);
10 }
11 else f[i] = 1;
12 }
13 return ans;
14 }

Test Expected Got

 vector<string> words {"faction", "fight", "and", "are", "attitude"}; 3 3 

cout << longestSublist(words);

 vector<string> words {}; 0 0 

cout << longestSublist(words);

Passed all tests! 

Đúng
Marks for this submission: 1,00/1,00.
