Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit5b083c6

Browse files
committed
📜 Update README table (🛠️ from Github Actions)
1 parent3d307cf commit5b083c6

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -76,7 +76,7 @@ If you would like to have collaborator permissions on the repo to merge your own
7676
<sub>[0187 - Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](cpp%2F0187-repeated-dna-sequences.cpp)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](java%2F0187-repeated-dna-sequences.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0187-repeated-dna-sequences.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F0187-repeated-dna-sequences.py)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](typescript%2F0187-repeated-dna-sequences.ts)</div></sub>
7777
<sub>[0380 - Insert Delete Get Random O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0380-insert-delete-getrandom-o1.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0380-insert-delete-getrandom-o1.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0380-insert-delete-getrandom-o1.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0380-insert-delete-getrandom-o1.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0380-insert-delete-getrandom-o1.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0380-insert-delete-getrandom-o1.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0380-insert-delete-getrandom-o1.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0380-insert-delete-getrandom-o1.ts)</div></sub>
7878
<sub>[1461 - Check if a String Contains all Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](cpp%2F1461-check-if-a-string-contains-all-binary-codes-of-size-k.cpp)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F1461-check-if-a-string-contains-all-binary-codes-of-size-k.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F1461-check-if-a-string-contains-all-binary-codes-of-size-k.py)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>
79-
<sub>[0304 - Range Sum Query 2D Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](cpp%2F0304-range-sum-query-2d-immutable.cpp)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'></div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0304-range-sum-query-2d-immutable.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F0304-range-sum-query-2d-immutable.py)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>
79+
<sub>[0304 - Range Sum Query 2D Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](cpp%2F0304-range-sum-query-2d-immutable.cpp)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](javascript%2F0304-range-sum-query-2d-immutable.js)</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0304-range-sum-query-2d-immutable.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F0304-range-sum-query-2d-immutable.py)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>
8080
<sub>[0665 - Non Decreasing Array](https://leetcode.com/problems/non-decreasing-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0665-non-decreasing-array.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0665-non-decreasing-array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0665-non-decreasing-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0665-non-decreasing-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0665-non-decreasing-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0665-non-decreasing-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](scala%2F0665-non-decreasing-array.scala)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0665-non-decreasing-array.ts)</div></sub>
8181
<sub>[0041 - First Missing Positive](https://leetcode.com/problems/first-missing-positive/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](cpp%2F0041-first-missing-positive.cpp)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](go%2F0041-first-missing-positive.go)</div></sub> | <sub><divalign='center'>[✔️](java%2F0041-first-missing-positive.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0041-first-missing-positive.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F0041-first-missing-positive.py)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](typescript%2F0041-first-missing-positive.ts)</div></sub>
8282
<sub>[1822 - Sign of An Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](python%2Fpython%2F1822-sign-of-the-product-of-an-array.py)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>
@@ -235,7 +235,7 @@ If you would like to have collaborator permissions on the repo to merge your own
235235
<sub>[0450 - Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0450-delete-node-in-a-bst.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F0450-delete-node-in-a-bst.py)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](typescript%2F0450-delete-node-in-a-bst.ts)</div></sub>
236236
<sub>[0102 - Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)</sub> | <sub><div align='center'>[✔️](c%2F0102-binary-tree-level-order-traversal.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0102-binary-tree-level-order-traversal.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0102-binary-tree-level-order-traversal.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0102-binary-tree-level-order-traversal.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0102-binary-tree-level-order-traversal.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0102-binary-tree-level-order-traversal.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0102-binary-tree-level-order-traversal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0102-binary-tree-level-order-traversal.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0102-binary-tree-level-order-traversal.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0102-binary-tree-level-order-traversal.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0102-binary-tree-level-order-traversal.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0102-binary-tree-level-order-traversal.ts)</div></sub>
237237
<sub>[0199 - Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)</sub> | <sub><div align='center'>[✔️](c%2F0199-binary-tree-right-side-view.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0199-binary-tree-right-side-view.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0199-binary-tree-right-side-view.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0199-binary-tree-right-side-view.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0199-binary-tree-right-side-view.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0199-binary-tree-right-side-view.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0199-binary-tree-right-side-view.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0199-binary-tree-right-side-view.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0199-binary-tree-right-side-view.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0199-binary-tree-right-side-view.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0199-binary-tree-right-side-view.ts)</div></sub>
238-
<sub>[0783 - Minimum Distance between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0783-minimum-distance-between-bst-nodes.kt)</div></sub> | <sub><divalign='center'></div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>
238+
<sub>[0783 - Minimum Distance between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0783-minimum-distance-between-bst-nodes.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F0783-minimum-distance-between-bst-nodes.py)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>
239239
<sub>[0101 - Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0101-symmetric-tree.kt)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>
240240
<sub>[1443 - Minimum Time to Collect All Apples in a Tree](https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](rust%2F1443-minimum-time-to-collect-all-apples-in-a-tree.rs)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>
241241
<sub>[0103 - Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0103-binary-tree-zigzag-level-order-traversal.kt)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp