Last active
May 30, 2019 04:36
-
-
Save kei9327/25bc32ff8f171b49ff4f0778d6662114 to your computer and use it in GitHub Desktop.
HackerRank>Algorithms>Warmup>SimpleArraySum
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
vector<string> split_string(string); | |
/* | |
* Complete the simpleArraySum function below. | |
*/ | |
int simpleArraySum(vector<int> ar) { | |
/* | |
* Write your code here. | |
*/ | |
int result = 0; | |
for (int i = 0; i < ar.size(); i++) { | |
result += ar[i]; | |
} | |
return result; | |
} | |
int main() | |
{ | |
ofstream fout(getenv("OUTPUT_PATH")); | |
int ar_count; | |
cin >> ar_count; | |
cin.ignore(numeric_limits<streamsize>::max(), '\n'); | |
string ar_temp_temp; | |
getline(cin, ar_temp_temp); | |
vector<string> ar_temp = split_string(ar_temp_temp); | |
vector<int> ar(ar_count); | |
for (int ar_itr = 0; ar_itr < ar_count; ar_itr++) { | |
int ar_item = stoi(ar_temp[ar_itr]); | |
ar[ar_itr] = ar_item; | |
} | |
int result = simpleArraySum(ar); | |
fout << result << "\n"; | |
fout.close(); | |
return 0; | |
} | |
vector<string> split_string(string input_string) { | |
string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) { | |
return x == y and x == ' '; | |
}); | |
input_string.erase(new_end, input_string.end()); | |
while (input_string[input_string.length() - 1] == ' ') { | |
input_string.pop_back(); | |
} | |
vector<string> splits; | |
char delimiter = ' '; | |
size_t i = 0; | |
size_t pos = input_string.find(delimiter); | |
while (pos != string::npos) { | |
splits.push_back(input_string.substr(i, pos - i)); | |
i = pos + 1; | |
pos = input_string.find(delimiter, i); | |
} | |
splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1)); | |
return splits; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment