2408. Design SQL π
Description
You are given two string arrays, names
and columns
, both of size n
. The ith
table is represented by the name names[i]
and contains columns[i]
number of columns.
You need to implement a class that supports the following operations:
- Insert a row in a specific table with an id assigned using an auto-increment method, where the id of the first inserted row is 1, and the id of each new row inserted into the same table is one greater than the id of the last inserted row, even if the last row was removed.
- Remove a row from a specific table. Removing a row does not affect the id of the next inserted row.
- Select a specific cell from any table and return its value.
- Export all rows from any table in csv format.
Implement the SQL
class:
SQL(String[] names, int[] columns)
- Creates the
n
tables.
- Creates the
bool ins(String name, String[] row)
- Inserts
row
into the tablename
and returnstrue
. - If
row.length
does not match the expected number of columns, orname
is not a valid table, returnsfalse
without any insertion.
- Inserts
void rmv(String name, int rowId)
- Removes the row
rowId
from the tablename
. - If
name
is not a valid table or there is no row with idrowId
, no removal is performed.
- Removes the row
String sel(String name, int rowId, int columnId)
- Returns the value of the cell at the specified
rowId
andcolumnId
in the tablename
. - If
name
is not a valid table, or the cell(rowId, columnId)
is invalid, returns"<null>"
.
- Returns the value of the cell at the specified
String[] exp(String name)
- Returns the rows present in the table
name
. - If name is not a valid table, returns an empty array. Each row is represented as a string, with each cell value (including the row's id) separated by a
","
.
- Returns the rows present in the table
Example 1:
Input:
["SQL","ins","sel","ins","exp","rmv","sel","exp"] [[["one","two","three"],[2,3,1]],["two",["first","second","third"]],["two",1,3],["two",["fourth","fifth","sixth"]],["two"],["two",1],["two",2,2],["two"]]
Output:
[null,true,"third",true,["1,first,second,third","2,fourth,fifth,sixth"],null,"fifth",["2,fourth,fifth,sixth"]]
Explanation:
// Creates three tables. SQL sql = new SQL(["one", "two", "three"], [2, 3, 1]); // Adds a row to the table "two" with id 1. Returns True. sql.ins("two", ["first", "second", "third"]); // Returns the value "third" from the third column // in the row with id 1 of the table "two". sql.sel("two", 1, 3); // Adds another row to the table "two" with id 2. Returns True. sql.ins("two", ["fourth", "fifth", "sixth"]); // Exports the rows of the table "two". // Currently, the table has 2 rows with ids 1 and 2. sql.exp("two"); // Removes the first row of the table "two". Note that the second row // will still have the id 2. sql.rmv("two", 1); // Returns the value "fifth" from the second column // in the row with id 2 of the table "two". sql.sel("two", 2, 2); // Exports the rows of the table "two". // Currently, the table has 1 row with id 2. sql.exp("two");
Example 2:
Input:
["SQL","ins","sel","rmv","sel","ins","ins"] [[["one","two","three"],[2,3,1]],["two",["first","second","third"]],["two",1,3],["two",1],["two",1,2],["two",["fourth","fifth"]],["two",["fourth","fifth","sixth"]]]
Output:
[null,true,"third",null,"<null>",false,true]
Explanation:
// Creates three tables. SQL sQL = new SQL(["one", "two", "three"], [2, 3, 1]); // Adds a row to the table "two" with id 1. Returns True. sQL.ins("two", ["first", "second", "third"]); // Returns the value "third" from the third column // in the row with id 1 of the table "two". sQL.sel("two", 1, 3); // Removes the first row of the table "two". sQL.rmv("two", 1); // Returns "<null>" as the cell with id 1 // has been removed from table "two". sQL.sel("two", 1, 2); // Returns False as number of columns are not correct. sQL.ins("two", ["fourth", "fifth"]); // Adds a row to the table "two" with id 2. Returns True. sQL.ins("two", ["fourth", "fifth", "sixth"]);
Constraints:
n == names.length == columns.length
1 <= n <= 104
1 <= names[i].length, row[i].length, name.length <= 10
names[i]
,row[i]
, andname
consist only of lowercase English letters.1 <= columns[i] <= 10
1 <= row.length <= 10
- All
names[i]
are distinct. - At most
2000
calls will be made toins
andrmv
. - At most
104
calls will be made tosel
. - At most
500
calls will be made toexp
.
Follow-up: Which approach would you choose if the table might become sparse due to many deletions, and why? Consider the impact on memory usage and performance.
Solutions
Solution 1: Hash Table
Create a hash table tables
to store the mapping of table names to table data rows. Directly simulate the operations in the problem.
The time complexity of each operation is $O(1)$, and the space complexity is $O(n)$.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 |
|