文件名称：DailyCodingPy:代表CodingINterviews
文件大小：33KB
文件格式：ZIP
更新时间：2024-04-18 18:57:27
Python
DailyCodingPy:代表CodingINterviews
【文件预览】：
DailyCodingPy-master
----main.py(70B)
----LeetCode()
--------1806. Minimum Number of Operations to Reinitialize a Permutation.py(819B)
--------1637. Widest Vertical Area Between Two Points Containing No Points.py(573B)
--------CSC.py(11B)
--------1769. Minimum Number of Operations to Move All Balls to Each Box.py(264B)
--------1395. Count Number of Teams.py(725B)
--------1315. Sum of Nodes with Even-Valued Grandparent.py(1KB)
--------402. Remove K Digits.py(386B)
--------921. Minimum Add to Make Parentheses Valid.py(380B)
--------1448. Count Good Nodes in Binary Tree.py(610B)
--------419. Battleships in a Board.py(484B)
--------Reverse String.py(366B)
--------814. Binary Tree Pruning.py(949B)
--------All Paths From Source to Target.py(2KB)
--------1519. Number of Nodes in the Sub-Tree With the Same Label.py(598B)
--------1038. Binary Search Tree to Greater Sum Tree.py(953B)
--------1561. Maximum Number of Coins You Can Get.py(324B)
--------TEST.py(61B)
--------1347. Minimum Number of Steps to Make Two Strings Anagram.py(454B)
--------1111. Maximum Nesting Depth of Two Valid Parentheses Strings.py(717B)
--------950. Reveal Cards In Increasing Order.py(615B)
--------1669. Merge In Between Linked Lists.py(1KB)
--------535. Encode and Decode TinyURL.py(686B)
--------1605. Find Valid Matrix Given Row and Column Sums.py(885B)
--------2. Add Two Numbers.py(2KB)
--------654. Maximum Binary Tree.py(1KB)
--------1104. Path In Zigzag Labelled Binary Tree.py(591B)
--------__init__.py(0B)
--------1282. Group the People Given the Group Size They Belong To.py(997B)
--------1382. Balance a Binary Search Tree.py(737B)
--------1557. Minimum Number of Vertices to Reach All Nodes.py(359B)
--------1325. Delete Leaves With a Given Value.py(864B)
--------701. Insert into a Binary Search Tree.py(843B)
--------1008. Construct Binary Search Tree from Preorder Traversal.py(1KB)
--------1409. Queries on a Permutation With Key.py(594B)
--------890. Find and Replace Pattern.py(372B)
--------1302. Deepest Leaves Sum.py(1KB)
--------1630. Arithmetic Subarrays.py(682B)
--------104. Maximum Depth of Binary Tree.py(715B)
--------1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.py(953B)
--------1305. All Elements in Two Binary Search Trees.py(1KB)
--------1. Two Sum.py(563B)
--------1261. Find Elements in a Contaminated Binary Tree.py(1KB)
--------1277. Count Square Submatrices with All Ones.py(659B)
----.idea()
--------misc.xml(199B)
--------vcs.xml(180B)
--------modules.xml(274B)
--------DailyCoding.iml(284B)
--------.gitignore(47B)
--------inspectionProfiles()
----YaPracRestart()
--------Sprint2()
--------Sprint3()
--------__init__.py(0B)
--------Spritn1()