<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>ans;
        unordered_map<int,bool>vis;
        for(int i=0;i<transactions.size();i++){
            for(int j=1;j<transactions.size();j++){
                string name1="";
                int k=0;
                while(transactions[i][k]!=',')name1.push_back(transactions[i][k++]);
                int time1 = 0;
                k++;
                while(transactions[i][k]!=','){
                    time1 = time1*10 + (transactions[i][k++]-'0');
                }
                k++;
                int val1 = 0;
                while(transactions[i][k]!=','){
                    val1 = val1*10 + (transactions[i][k++]-'0');
                }
                k = transactions[i].size()-1;
                string city1="";
                while(transactions[i][k]!=',')city1.push_back(transactions[i][k--]);

                string name2="";
                k=0;
                while(transactions[j][k]!=',')name2.push_back(transactions[j][k++]);
                int time2 = 0;
                k++;
                while(transactions[j][k]!=','){
                    time2 = time2*10 + (transactions[j][k++]-'0');
                }
                k++;
                int val2 = 0;
                while(transactions[j][k]!=','){
                    val2 = val2*10 + (transactions[j][k++]-'0');
                }
                k = transactions[j].size()-1;
                string city2="";
                while(transactions[j][k]!=',')city2.push_back(transactions[j][k--]);

                // cout<<i<<" "<<j<<" "<<time1<<" "<<time2<<endl;
                if(name1==name2 && city1!=city2 && abs(time1-time2)<=60){
                    if(!vis[i]){ans.push_back(transactions[i]);vis[i] = true;}
                    if(!vis[j]){ans.push_back(transactions[j]);vis[j]=true;}
                }
                if(val1>1000 && !vis[i]){ans.push_back(transactions[i]);vis[i] = true;}
                if(val2>1000 && !vis[j]){ans.push_back(transactions[j]);vis[j]=true;}
            }
        }

        return ans;
    }
};
15400