Given an int array `banks`, where `banks[i]` represents a balance of the `i-th` bank, and an int `target`. Find minimum number of transactions to make all balances **equal or greater** than `target`.\n\n**Example 1:**\n```\nInput: \nbankName = [A,   B,   C,  D]\nbanks =    [110, 180, 60, 90], target = 110\nOutput: 2\nExplanation:\nbankB gave bankC $50.\nbankB gave bankD $20.\n\n2 transactions are needed.\n```\n\n**Example 2:**\n```\nInput: \nbankName =  [A, B, C,  D,  E, F,  G,   H,  I]\nbanks =     [2, 1, 0, 10, 10, 10, 10, 14, 15], target = 8\nOuput: 6\nExplanation:\nbankH gave bankA $6;\nbankI gave bankB $7;\nbankG gave bankC $2;\nbankF gave bankC $2;\nbankE gave bankC $2;\nbankD gave bankC $2;\n\n6 transactions are needed.\n```\n\n```\n    class Solution {\n\t\tpublic int minTrans(int[] banks) {\n\t\t   // add your code here\n\t\t}\n\t}\n```\n\nRelated problems:\n* https://leetcode.com/problems/optimal-account-balancing/ (premium)\n\n\n

Given an int array banks, where banks[i] represents a balance of the i-th bank, and an int target. Find minimum number of transactions to make all balances equa