-
Notifications
You must be signed in to change notification settings - Fork 0
/
Swap Nodes [Algo].js
123 lines (96 loc) · 2.63 KB
/
Swap Nodes [Algo].js
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'swapNodes' function below.
*
* The function is expected to return a 2D_INTEGER_ARRAY.
* The function accepts following parameters:
* 1. 2D_INTEGER_ARRAY indexes
* 2. INTEGER_ARRAY queries
*/
function swapNodes(indexes, queries) {
class Node {
constructor(data, depth) {
this.data = data;
this.left = null;
this.right = null;
this.depth = depth;
}
}
let response = [];
const queriesLen = queries.length;
const indexesLen = indexes.length;
const nodes = [new Node(1, 1)];
function createNode(value, root, position) {
if (value > -1) {
const depth = root.depth + 1;
const node = new Node(value, depth);
root[position] = node;
nodes.push(node);
}
}
function swapNode(k) {
const temp = nodes[k].left;
nodes[k].left = nodes[k].right;
nodes[k].right = temp;
}
function inOrder(_root) {
const result = [];
const action = root => {
if (root !== null) {
action(root.left);
result.push(root.data);
action(root.right);
}
};
action(_root);
return result;
}
for (let i = 0; i < indexesLen; i++) {
createNode(indexes[i][0], nodes[i], "left");
createNode(indexes[i][1], nodes[i], "right");
}
for (let i = 0; i < queriesLen; i++) {
const jump = queries[i];
for (let k = 0; k < nodes.length; k++) {
const node = nodes[k];
if (0 === node.depth % jump) {
//console.log('swapNode', node.data), jump;
swapNode(k);
}
}
response.push(inOrder(nodes[0]));
}
return response;
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const n = parseInt(readLine().trim(), 10);
let indexes = Array(n);
for (let i = 0; i < n; i++) {
indexes[i] = readLine().replace(/\s+$/g, '').split(' ').map(indexesTemp => parseInt(indexesTemp, 10));
}
const queriesCount = parseInt(readLine().trim(), 10);
let queries = [];
for (let i = 0; i < queriesCount; i++) {
const queriesItem = parseInt(readLine().trim(), 10);
queries.push(queriesItem);
}
const result = swapNodes(indexes, queries);
ws.write(result.map(x => x.join(' ')).join('\n') + '\n');
ws.end();
}