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

Commitd36207c

Browse files
committed
📜 Update README table (🛠️ from Github Actions)
1 parentb284293 commitd36207c

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
@@ -252,7 +252,7 @@ If you would like to have collaborator permissions on the repo to merge your own
252252
<sub>[0096 - Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)</sub> | <sub><divalign='center'>[✔️](c%2F0096-unique-binary-search-trees.c)</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'>[✔️](java%2F0096-unique-binary-search-trees.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0096-unique-binary-search-trees.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>
253253
<sub>[0129 - Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)</sub> | <sub><divalign='center'>[✔️](c%2F0129-sum-root-to-leaf-numbers.c)</div></sub> | <sub><divalign='center'>[✔️](cpp%2F0129-sum-root-to-leaf-numbers.cpp)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](java%2F0129-sum-root-to-leaf-numbers.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0129-sum-root-to-leaf-numbers.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>
254254
<sub>[0337 - House Robber III](https://leetcode.com/problems/house-robber-iii/)</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'>[✔️](java%2F0337-house-robber-iii.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0337-house-robber-iii.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>
255-
<sub>[0951 - Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/)</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'>[✔️](java%2F0951-flip-equivalent-binary-trees.java)</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>
255+
<sub>[0951 - Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/)</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'>[✔️](java%2F0951-flip-equivalent-binary-trees.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0951-flip-equivalent-binary-trees.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>
256256
<sub>[1993 - Operations On Tree](https://leetcode.com/problems/operations-on-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'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub>
257257
<sub>[0894 - All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees/)</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'>[✔️](java%2F0894-all-possible-full-binary-trees.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0894-all-possible-full-binary-trees.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F0894-all-possible-full-binary-trees.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>
258258
<sub>[0513 - Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)</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'>[✔️](java%2F0513-find-bottom-left-tree-value.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0513-find-bottom-left-tree-value.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>
@@ -331,7 +331,7 @@ If you would like to have collaborator permissions on the repo to merge your own
331331
<sub>[1466 - Reorder Routes to Make All Paths Lead to The City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F1466-Reorder-Routes-to-Make-All-Paths-Lead-To-The-City-Zero.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
332332
<sub>[0994 - Rotting Oranges](https://leetcode.com/problems/rotting-oranges/)</sub> | <sub><div align='center'>[✔️](c%2F0994-rotting-oranges.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0994-rotting-oranges.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0994-rotting-oranges.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0994-rotting-oranges.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0994-rotting-oranges.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0994-rotting-oranges.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0994-rotting-oranges.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0994-rotting-oranges.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'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0994-rotting-oranges.ts)</div></sub>
333333
<sub>[0286 - Walls And Gates](https://leetcode.com/problems/walls-and-gates/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](cpp%2F0286-walls-and-gates.cpp)</div></sub> | <sub><divalign='center'>[✔️](csharp%2F0286-walls-and-gates.cs)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](java%2F0286-walls-and-gates.java)</div></sub> | <sub><divalign='center'>[✔️](javascript%2F0286-walls-and-gates.js)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](python%2F0286-walls-and-gates.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>
334-
<sub>[0909 - Snakes And Ladders](https://leetcode.com/problems/snakes-and-ladders/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](csharp%2F0909-snakes-and-ladders.cs)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](java%2F0909-snakes-and-ladders.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'></div></sub> | <sub><divalign='center'>[✔️](python%2F0909-snakes-and-ladders.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>
334+
<sub>[0909 - Snakes And Ladders](https://leetcode.com/problems/snakes-and-ladders/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](csharp%2F0909-snakes-and-ladders.cs)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](java%2F0909-snakes-and-ladders.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0909-snakes-and-ladders.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F0909-snakes-and-ladders.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>
335335
<sub>[0752 - Open The Lock](https://leetcode.com/problems/open-the-lock/)</sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](csharp%2F0752-open-the-lock.cs)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](java%2F0752-open-the-lock.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0752-open-the-lock.kt)</div></sub> | <sub><divalign='center'>[✔️](python%2F0752-open-the-lock.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>
336336
<sub>[0802 - Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/)</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'>[✔️](java%2F0802-find-eventual-safe-states.java)</div></sub> | <sub><divalign='center'>❌</div></sub> | <sub><divalign='center'>[✔️](kotlin%2F0802-find-eventual-safe-states.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>
337337
<sub>[0207 - Course Schedule](https://leetcode.com/problems/course-schedule/)</sub> | <sub><div align='center'>[✔️](c%2F0207-course-schedule.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0207-course-schedule.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0207-course-schedule.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0207-course-schedule.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0207-course-schedule.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0207-course-schedule.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0207-course-schedule.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0207-course-schedule.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%2F0207-course-schedule.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0207-course-schedule.ts)</div></sub>

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp