View difference between Paste ID: WKPF73Q4 and RQbfEqWZ

-#include <iostream>
+class Solution {
-#include<string>
+
-#include<vector>
+    class KeyboardRow {
-#include<algorithm>
+    public:
-
+        bool exists_in_single_row(std::string str){
-
+            std::transform(str.begin(), str.end(), str.begin(), [](char s){ return std::toupper(s); });
-class solution{
+            bool r1 = std::all_of(str.begin(), str.end(), [this](char c){ return in_row1(c); });
-
+            bool r2 = std::all_of(str.begin(), str.end(), [this](char c){ return in_row2(c); });
-
+            bool r3 = std::all_of(str.begin(), str.end(), [this](char c){ return in_row3(c); });
             return r1 || r2 || r3;
-
+
-    std::vector<std::string>findWords(std::vector<std::string>& words)
+
-    {
+    private:
-
+
-        char row1[] ={'q','w','e','r','t','y','u','i','o','p','Q','W','E','R','T','Y','U','I','O','P'};
+        bool in_row1(char c)
-
+        { return std::find(std::begin(row1), std::end(row1), c) != std::end(row1); }
-        char row2[] ={'a','s','d','f','g','h','j','k','l','A','S','D','F','G','H','J','K','L'};
+
-
+        bool in_row2(char c)
-        char row3[]={'z','x','c','v','b','n','m','Z','X','C','V','B','N','M'};
+        { return std::find(std::begin(row2), std::end(row2), c) != std::end(row2); }
-
+
-        bool result[words.size()+1];
+        bool in_row3(char c)
-
+        { return std::find(std::begin(row3), std::end(row3), c) != std::end(row3); }
-
+
-
+    private:
-        // iterate through the words
+        const char row1[10] = {'Q','W','E','R','T','Y','U','I','O','P'};
-
+        const char row2[9] = {'A','S','D','F','G','H','J','K','L'};
-        for(size_t i =0; i<words.size(); i++)
+        const char row3[7] = {'Z','X','C','V','B','N','M'};
-        {
+    };
-            result[i] = true;
+
-
+
-            char *found;
+    vector<string> findWords(vector<string>& words) {
-
+        KeyboardRow kr;
-
+        std::vector<std::string> result;
-
+
-            // search through row1
+        std::copy_if(words.begin(), words.end(), std::back_inserter(result),
-
+                    [&kr](const std::string& s){ return kr.exists_in_single_row(s); });
-            found = std::find(row1, row1+20, words[i][0]); //if first letter is found in row 1
+        return result;
-
+    }
-            if(found != row1+20)
+};