반응형
https://www.hackerrank.com/challenges/diagonal-difference/problem
#include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
/*
* Complete the 'diagonalDifference' function below.
*
* The function is expected to return an INTEGER.
* The function accepts 2D_INTEGER_ARRAY arr as parameter.
*/
int diagonalDifference(vector<vector<int>> arr) {
int a = 0, b = 0, arrsize = arr.size(), result = 0;
for (int i = 0; i < arrsize; i++) {
a += arr[i][i];
b += arr[i][arrsize-1-i];
}
result = abs(a-b);
cout << arrsize;
return result;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
vector<vector<int>> arr(n);
for (int i = 0; i < n; i++) {
arr[i].resize(n);
string arr_row_temp_temp;
getline(cin, arr_row_temp_temp);
vector<string> arr_row_temp = split(rtrim(arr_row_temp_temp));
for (int j = 0; j < n; j++) {
int arr_row_item = stoi(arr_row_temp[j]);
arr[i][j] = arr_row_item;
}
}
int result = diagonalDifference(arr);
fout << result << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
vector<string> split(const string &str) {
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos) {
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}
반응형
'Training > HackerRank' 카테고리의 다른 글
[C++][Implementation] Number Line Jumps (0) | 2021.07.30 |
---|---|
[C++][Implementation] Apple and Orange (0) | 2021.07.28 |
[C++][Implementation] Grading Students (0) | 2021.07.19 |
[C++][Warmup] Time Conversion (0) | 2020.09.06 |
[C++][Warmup] Mini-Max Sum (0) | 2020.08.03 |