Created
June 3, 2019 02:42
-
-
Save kei9327/9ace5a2382bcc0091468b10a01c360a0 to your computer and use it in GitHub Desktop.
HackerRank>Algorithm>Warmup>PlusMinus
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> | |
#include <stdio.h> | |
using namespace std; | |
vector<string> split_string(string); | |
// Complete the plusMinus function below. | |
void plusMinus(vector<int> arr) { | |
vector<int> result{0,0,0}; | |
for (int i=0; i<arr.size(); i++) { | |
if(arr[i] > 0){ | |
result[0]++; | |
} else if (arr[i] < 0) { | |
result[1]++; | |
} else { | |
result[2]++; | |
} | |
} | |
printf("%f \n%f \n%f", (double)result[0] / arr.size(), | |
(double)result[1] / arr.size(), (double)result[2] / arr.size()); | |
} | |
int main() | |
{ | |
int n; | |
cin >> n; | |
cin.ignore(numeric_limits<streamsize>::max(), '\n'); | |
string arr_temp_temp; | |
getline(cin, arr_temp_temp); | |
vector<string> arr_temp = split_string(arr_temp_temp); | |
vector<int> arr(n); | |
for (int i = 0; i < n; i++) { | |
int arr_item = stoi(arr_temp[i]); | |
arr[i] = arr_item; | |
} | |
plusMinus(arr); | |
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