<p>A transaction is possibly invalid if:</p>

<ul>
	<li>the amount exceeds <code>$1000</code>, or;</li>
	<li>if it occurs within (and including) <code>60</code> minutes of another transaction with the <strong>same name</strong> in a <strong>different city</strong>.</li>
</ul>

<p>You are given an array of strings <code>transaction</code> where <code>transactions[i]</code> consists of comma-separated values representing the name, time (in minutes), amount, and city of the transaction.</p>

<p>Return a list of <code>transactions</code> that are possibly invalid. You may return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;alice,50,100,beijing&quot;]
<strong>Output:</strong> [&quot;alice,20,800,mtv&quot;,&quot;alice,50,100,beijing&quot;]
<strong>Explanation:</strong> The first transaction is invalid because the second transaction occurs within a difference of 60 minutes, have the same name and is in a different city. Similarly the second one is invalid too.</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;alice,50,1200,mtv&quot;]
<strong>Output:</strong> [&quot;alice,50,1200,mtv&quot;]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;bob,50,1200,mtv&quot;]
<strong>Output:</strong> [&quot;bob,50,1200,mtv&quot;]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>transactions.length &lt;= 1000</code></li>
	<li>Each <code>transactions[i]</code> takes the form <code>&quot;{name},{time},{amount},{city}&quot;</code></li>
	<li>Each <code>{name}</code> and <code>{city}</code> consist of lowercase English letters, and have lengths between <code>1</code> and <code>10</code>.</li>
	<li>Each <code>{time}</code> consist of digits, and represent an integer between <code>0</code> and <code>1000</code>.</li>
	<li>Each <code>{amount}</code> consist of digits, and represent an integer between <code>0</code> and <code>2000</code>.</li>
</ul>

class Solution {
public:
    vector<string> invalidTransactions(vector<string>& transactions) {
        vector<string> result;
        vector<vector<string>> parsed;

        for (const string& transaction : transactions) {
            stringstream ss(transaction);
            string item;
            vector<string> temp;
            while (getline(ss, item, ',')) {
                temp.push_back(item);
            }
            parsed.push_back(temp);
        }

        for (int i = 0; i < transactions.size(); ++i) {
            string name1 = parsed[i][0];
            int time1 = stoi(parsed[i][1]);
            int amount1 = stoi(parsed[i][2]);
            string city1 = parsed[i][3];

            if (amount1 > 1000) {
                result.push_back(transactions[i]);
                continue;
            }

            bool invalid = false;
            for (int j = 0; j < transactions.size(); ++j) {
                if (i == j) continue;
                string name2 = parsed[j][0];
                int time2 = stoi(parsed[j][1]);
                string city2 = parsed[j][3];

                if (name1 == name2 && city1 != city2 && abs(time1 - time2) <= 60) {
                    invalid = true;
                    break;
                }
            }

            if (invalid) {
                result.push_back(transactions[i]);
            }
        }

        return result;
    }
};
20000