한 일상

분류 전체보기 검색 결과

해당 글 96건

HackkerRank - Find the Median, Palindrome Index, Anagram, Making Anagrams

[풀이 - Find the Median] : 더보기 int findMedian(vector arr) { sort(arr.begin(), arr.end()); int idx = arr.size() / 2; return arr[idx]; } [풀이 - Palindrome Index] : 더보기 bool IsPalindrome(string s) { int l = s.length(); for(int i = 0; i < (l / 2); ++i) { int r = l-1-i; // if(s[i] != s[r]) return false; } // return true; } // int palindromeIndex(string s) { int l = s.length(); int result = -1; // int i ..

Algorithm 2021. 3. 16. 00:47

HackkerRank - Gemstones, Beautiful Binary String, Closest Numbers, The Love-Letter Mystery

[풀이 - Gemstones] : 더보기 int gemstones(vector arr) { int count = arr.size(); vector mv; // for(int i = 0; i < count; ++i) { map m; for(int j = 0 ; j < arr[i].length(); ++j) { string s = arr[i]; int value = s[j] - 'a'; m[value]++; } mv.push_back(m); } // int result = 0; for(int j = 0; j < 26; ++j) { bool b = true; for(int i = 0; i < mv.size(); ++i) { b *= mv[i][j]; } if(b == true) ++result; } // re..

Algorithm 2021. 3. 15. 16:00

HackkerRank - Separate the Numbers, Funny String, Counting Sort 1, Counting Sort 2

[풀이 - Separate the Numbers] : 더보기 void separateNumbers(string s) { int count = s.length(); for(int i = 1; i

Algorithm 2021. 3. 13. 23:32

HackkerRank - Quicksort1 - Partition, Pangrams, Weighted Uniform Strings

[풀이 - Quicksort1 - Partition] : 더보기 vector quickSort(vector arr) { vector result; int pivot = arr[0]; // vector left; vector equal; vector right; // for(int i = 0; i pivot) right.push_back(arr[i]); } // for(int i : left) result.push_back(i); for(int i : equal) res..

Algorithm 2021. 3. 8. 20:18

HackkerRank - Mars Exploration, Running Time of Algorithms, HackerRank in a String!

[풀이 - Mars Exploration] : 더보기 int marsExploration(string s) { int result = 0; string signal = "SOS"; // for(int i = 0; i arr[i]) && (i > 0)) { swap(arr[i-1],..

Algorithm 2021. 3. 4. 20:22

HackerRank - Insertion Sort - Part 2, Correctness and the Loop Invariant, Caesar Cipher

[풀이 - Insertion Sort - Part 2] : 더보기 void CheckArray(vector& arr, int idx) { int value = arr[idx]; // for(int i = idx - 1; i >= 0; --i) { if(arr[i] > value) { arr[i+1] = arr[i]; if(i == 0) arr[i] = value; } else { arr[i+1] = value; return; } } } // void PrintArray(const vector& arr) { for(int i = 0; i < arr.size(); ++i) cout =0 && value

Algorithm 2021. 3. 2. 20:25

Hackerrank - Insertion Sort(Part_1), Strong Password, Two Characters

[풀이 - Insertion Sort(Part_1)] : 더보기 void insertionSort1(int n, vector arr) { if(n == 1) { cout

Algorithm 2021. 2. 26. 20:19

Hackerrank - Big Sorting, Super Reduced String, Intro to Tutorial Challenges, CamelCase

[풀이 - Big Sorting] : 더보기 bool strcomp(string s1, string s2) { int l1 = s1.size(); int l2 = s2.size(); // if(l1 != l2) return l1 < l2; else { for(int i = 0; i < min(l1, l2); ++i) { bool value = (s1[i] == s2[i]); // if(value) continue; else return (s1[i] < s2[i]); } } // return false; } vector bigSorting(vector unsorted) { vector result = unsorted; sort(result.begin(), result.end(), strcomp); retu..

Algorithm 2021. 2. 25. 20:12