План по разбору задач
-
Зачем нужно уметь решать задачи на бинарные деревья?
-
Рассказываю про терминрологию
- Node, узел
- Родитель, Ребенок
- Лист, Корень
- Поддерево
- Высота дерева и какие деревья называют бинарными
| openapi: 3.0.3 | |
| info: | |
| title: Algocode service | |
| description: |- | |
| Сервис для алгоритмической платформы | |
| version: 0.0.1 | |
| externalDocs: | |
| url: 'TODO' | |
| description: README | |
| servers: |
| {'[4,5,6,7,0,1,2]\n0': '4', '[4,5,6,7,0,1,2]\n3': '-1', '[1]\n0': '-1', '[1]\n1': '0', '[1]\n2': '-1', '[1,3]\n0': '-1', '[1,3]\n1': '0', '[1,3]\n2': '-1', '[1,3]\n3': '1', '[1,3]\n4': '-1', '[3,1]\n0': '-1', '[3,1]\n1': '1', '[3,1]\n2': '-1', '[3,1]\n3': '0', '[3,1]\n4': '-1', '[1,3,5]\n0': '-1', '[1,3,5]\n1': '0', '[1,3,5]\n2': '-1', '[1,3,5]\n3': '1', '[1,3,5]\n4': '-1', '[1,3,5]\n5': '2', '[1,3,5]\n6': '-1', '[3,5,1]\n0': '-1', '[3,5,1]\n1': '2', '[3,5,1]\n2': '-1', '[3,5,1]\n3': '0', '[3,5,1]\n4': '-1', '[3,5,1]\n5': '1', '[3,5,1]\n6': '-1', '[5,1,3]\n0': '-1', '[5,1,3]\n1': '1', '[5,1,3]\n2': '-1', '[5,1,3]\n3': '2', '[5,1,3]\n4': '-1', '[5,1,3]\n5': '0', '[5,1,3]\n6': '-1', '[4,5,6,7,0,1,2]\n1': '5', '[4,5,6,7,0,1,2]\n2': '6', '[4,5,6,7,0,1,2]\n4': '0', '[4,5,6,7,0,1,2]\n5': '1', '[4,5,6,7,0,1,2]\n6': '2', '[4,5,6,7,0,1,2]\n7': '3', '[4,5,6,7,0,1,2]\n8': '-1', '[7,8,1,2,3,4,5,6]\n2': '3', '[4,5,1,2,3]\n1': '2', '[1,2,3,4,5,6]\n4': '3', '[3,4,5,6,1,2]\n2': '5', '[5,1,2,3,4]\n4': '4', '[1,2,3,4,5,6]\n1': |
| [{"input": "[1,1,1,2,2,3]\n2", "output": "[1, 2]"}, {"input": "[1]\n1", "output": "[1]"}, {"input": "[-1,-1]\n1", "output": "[-1]"}, {"input": "[1,2]\n2", "output": "[1, 2]"}, {"input": "[3,0,1,0]\n1", "output": "[0]"}, {"input": "[1,1,1,2,2,3333]\n2", "output": "[1, 2]"}, {"input": "[4,1,-1,2,-1,2,3]\n2", "output": "[-1, 2]"}, {"input": "[1,1,1,2,2,2,3,3,3]\n3", "output": "[1, 2, 3]"}, {"input": "[5,3,1,1,1,3,73,1]\n1", "output": "[1]"}, {"input": "[5,3,1,1,1,3,73,1]\n2", "output": "[1, 3]"}, {"input": "[5,3,1,1,1,3,5,73,1]\n3", "output": "[1, 3, 5]"}, {"input": "[3,2,3,1,2,4,5,5,6,7,7,8,2,3,1,1,1,10,11,5,6,2,4,7,8,5,6]\n10", "output": "[1, 2, 5, 3, 6, 7, 4, 8, 10, 11]"}, {"input": "[5,2,5,3,5,3,1,1,3]\n2", "output": "[3, 5]"}, {"input": "[2,3,4,1,4,0,4,-1,-2,-1]\n2", "output": "[4, -1]"}, {"input": "[-1,1,4,-4,3,5,4,-2,3,-1]\n3", "output": "[-1, 3, 4]"}, {"input": "[5,-3,9,1,7,7,9,10,2,2,10,10,3,-1,3,7,-9,-1,3,3]\n3", "output": "[3, 7, 10]"}, {"input": "[6,0,1,4,9,7,-3,1,-4,-8,4,-7,-3,3,2,-3,9,5,-4,0]\n6", |
| import requests | |
| import json | |
| import pickle | |
| import time | |
| from random import randint | |
| from hashlib import sha256 | |
| leetcode_token = "..." | |
| leetcode_cookie = "..." |
| [{"input": "[1,1,0,1,1,1]", "output": "3"},{"input": "[1,0,1,1,0,1]", "output": "2"},{"input": "[1,1,0,1]", "output": "2"},{"input": "[1]", "output": "1"},{"input": "[0]", "output": "0"},{"input": "[0,0]", "output": "0"},{"input": "[1,0]", "output": "1"},{"input": "[0,1]", "output": "1"},{"input": "[1,1]", "output": "2"},{"input": "[1,0,1,1]", "output": "2"},{"input": "[1,0,1]", "output": "1"},{"input": "[1,1,1,1,1,1,1,1]", "output": "8"},{"input": "[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1 |
| [{"input": "[10,9,2,5,3,7,101,18]", "output": "4"},{"input": "[0,1,0,3,2,3]", "output": "4"},{"input": "[7,7,7,7,7,7,7]", "output": "1"},{"input": "[0]", "output": "1"},{"input": "[2,2]", "output": "1"},{"input": "[-2,-1]", "output": "2"},{"input": "[1,2,3]", "output": "3"},{"input": "[1,3,2]", "output": "2"},{"input": "[3,1,2]", "output": "2"},{"input": "[3,2,1]", "output": "1"},{"input": "[4,4,4,4,4]", "output": "1"},{"input": "[-1,-2,-3,-4,-5,-6]", "output": "1"},{"input": "[10,9,2,5,3,4]", "output": "3"},{"input": "[4,10,4,3,8,9]", "output": "3"},{"input": "[10,9,8,7,6,5,4,3,2,1]", "output": "1"},{"input": "[1,3,6,7,9,4,10,5,6]", "output": "6"},{"input": "[18,55,66,2,3,54]", "output": "3"},{"input": "[2,15,3,7,8,6,18]", "output": "5"},{"input": "[11,12,13,14,15,6,7,8,101,18]", "output": "6"},{"input": "[3,5,6,2,5,4,19,5,6,7,12]", "output": "6"},{"input": "[10,22,9,33,21,50,41,60,80]", "output": "6"},{"input": "[10,9,2,5,3,7,200,18,101,102,103]", "output": "7"},{"input": "[1,2,3,4,5,6,7,8,9,10,11,12,13,14, |
| [{"input": "[2,7,11,15]\n9", "output": "[0,1]"},{"input": "[2,7,11,15]\n9", "output": "[0,1]"},{"input": "[2,7,11,15]\n9", "output": "[0,1]"},{"input": "[1,0,2]", "output": "5"},{"input": "[1,2,2]", "output": "4"},{"input": "[1,3,2,2,1]", "output": "7"},{"input": "[1,2,87,87,87,2,1]", "output": "13"},{"input": "[29,51,87,87,72,12]", "output": "12"},{"input": "[1,3,4,5,2]", "output": "11"},{"input": "[1,2,4,4,4,3]", "output": "10"},{"input": "[1,2,3,1,0]", "output": "9"},{"input": "[1,6,10,8,7,3,2]", "output": "18"},{"input": "[0,1,2,3,2,1]", "output": "13"},{"input": "[0,1,2,5,3,2,7]", "output": "15"},{"input": "[5,3,7,3]", "output": "6"},{"input": "[1,2,3]", "output": "6"},{"input": "[1,2,3,5,4,3,2,1]", "output": "21"},{"input": "[1,2,3,5,4,3,2,1,4,3,2,1]", "output": "31"},{"input": "[1,2,3,5,4,3,2,1,4,3,2,1,3,2,1,1,2,3,4]", "output": "47"},{"input": "[1,2,3,5,4,3,2,1,4,3,2,1,3,2,1,1,2,3,4,4,3,2,1]", "output": "57"},{"input": "[10,10,10,10,10,10]", "output": "6"},{"input": "[5,10,10,10,10,10,10]", "output": |
| [{"input": "[2,7,11,15]\n9", "output": "[0,1]"},{"input": "[3,2,4]\n6", "output": "[1,2]"},{"input": "[3,3]\n6", "output": "[0,1]"},{"input": "[3,2,3]\n6", "output": "[0,2]"},{"input": "[2,5,5,11]\n10", "output": "[1,2]"},{"input": "[0,4,3,0]\n0", "output": "[0,3]"},{"input": "[-3,4,3,90]\n0", "output": "[0,2]"},{"input": "[-1,-2,-3,-4,-5]\n-8", "output": "[2,4]"},{"input": "[5,75,25]\n100", "output": "[1,2]"},{"input": "[2222222,2222222]\n4444444", "output": "[0,1]"},{"input": "[1,6142,8192,10239]\n18431", "output": "[2,3]"},{"input": "[-10,-1,-18,-19]\n-19", "output": "[1,2]"},{"input": "[-10,7,19,15]\n9", "output": "[0,2]"},{"input": "[0,3,-3,4,-1]\n-1", "output": "[0,4]"},{"input": "[-18,12,3,0]\n-6", "output": "[0,1]"},{"input": "[1,3,4,2]\n6", "output": "[2,3]"},{"input": "[3,2,95,4,-3]\n92", "output": "[2,4]"},{"input": "[6,5,7,8,9,3]\n10", "output": "[2,5]"},{"input": "[150,24,79,50,88,345,3]\n200", "output": "[0,3]"},{"input": "[2,1,9,4,4,56,90,3]\n8", "output": "[3,4]"},{"input": "[-6,1,0,4]\n-5", " |
План по разбору задач
Зачем нужно уметь решать задачи на бинарные деревья?
Рассказываю про терминрологию
| #include <iostream> | |
| #include <unordered_map> | |
| #include <string> | |
| #include <vector> | |
| #include <bitset> | |
| #include <unordered_set> | |
| using namespace std; | |
| std::pair<std::bitset<26>, std::vector<std::bitset<26>>> bin_from_str(const string& s) { |