Skip to content

Commit 23c4b6e

yanglbme yanglbme

committed

feat: add new lcp problems

1 parent 4bbaff4 commit 23c4b6eCopy full SHA for 23c4b6e

File tree

54 files changed

+1044

-464

lines changed

.github/workflows
- contributors.yml
lcp
- LCP 02. 分式化简
  - README.md
- LCP 03. 机器人大冒险
  - README.md
- LCP 04. 覆盖
  - README.md
- LCP 05. 发 LeetCoin
  - README.md
- LCP 06. 拿硬币
  - README.md
- LCP 07. 传递信息
  - README.md
- LCP 08. 剧情触发时间
  - README.md
- LCP 09. 最小跳跃次数
  - README.md
- LCP 10. 二叉树任务调度
  - README.md
- LCP 11. 期望个数统计
  - README.md
- LCP 12. 小张刷题计划
  - README.md
- LCP 13. 寻宝
  - README.md
- LCP 14. 切分数组
  - README.md
- LCP 15. 游乐园的迷宫
  - README.md
- LCP 16. 游乐园的游览计划
  - README.md
- LCP 18. 早餐组合
  - README.md
- LCP 20. 快速公交
  - README.md
- LCP 21. 追逐游戏
  - README.md
- LCP 23. 魔术排列
  - README.md
- LCP 24. 数字游戏
  - README.md
- LCP 25. 古董键盘
  - README.md
- LCP 26. 导航装置
  - README.md
- LCP 27. 黑盒光线反射
  - README.md
- LCP 28. 采购方案
  - README.md
- LCP 29. 乐团站位
  - README.md
- LCP 30. 魔塔游戏
  - README.md
- LCP 31. 变换的迷宫
  - README.md
- LCP 32. 批量处理任务
  - README.md
- LCP 33. 蓄水
  - README.md
- LCP 34. 二叉树染色
  - README.md
- LCP 35. 电动车游城市
  - README.md
- LCP 36. 最多牌组数
  - README.md
- LCP 37. 最小矩形面积
  - README.md
- LCP 38. 守卫城堡
  - README.md
- LCP 39. 无人机方阵
  - README.md
- LCP 41. 黑白翻转棋
  - README.md
- LCP 42. 玩具套圈
  - README.md
- LCP 43. 十字路口的交通
  - README.md
- LCP 44. 开幕式焰火
  - README.md
- LCP 45. 自行车炫技赛场
  - README.md
- LCP 46. 志愿者调配
  - README.md
  - images
    - 1630061228-gnZsOz-image.png
    - 1630061300-WuVkeF-image.png
- LCP 47. 入场安检
  - README.md
  - images
    - 1628841618-bFKsnt-c60e38199a225ad62f13b954872edf9b.gif
    - 1628843202-cdFPSt-c24754f1a5ff56989340ba5004dc5eda.gif
- LCP 48. 无限棋局
  - README.md
  - images
    - 1629800639-KabOfY-902b87df29998b1c181146c8fdb3a4b6.gif
- LCP 49. 环形闯关游戏
  - README.md
  - images
    - 1630392170-ucncVS-图片.png
- README.md
- main.py
- summary.md

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

54 files changed

+1044

-464

lines changed

`‎.github/workflows/contributors.yml‎`

Lines changed: 3 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,12 +9,10 @@ jobs:`
`9`	`9`	`runs-on: ubuntu-latest`
`10`	`10`	`if: github.repository == 'doocs/leetcode'`
`11`	`11`	`steps:`
`12`		`- - uses: bubkoo/contributors-list@v1`
`13`		`- name: contributors-doocs-leetcode`
	`12`	`+ - uses: wow-actions/contributors-list@v1`
	`13`	`+ name: Update contributors`
`14`	`14`	`with:`
`15`	`15`	`GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}`
`16`	`16`	`svgPath: images/contributors.svg`
`17`	`17`	`svgWidth: 890`
`18`		`- round: true`
`19`		`- includeBots: true`
`20`		`- commitMessage: 'chore: update contributors to @doocs/leetcode'`
	`18`	`+ commitMessage: "chore: update contributors to leetcode project @doocs"`

`‎lcp/LCP 02. 分式化简/README.md‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -41,7 +41,6 @@`
`41`	`41`	`<li>答案的<code>n, m</code>的取值都能被32位int整型存下(即不超过<code>2 ^ 31 - 1</code>)。</li>`
`42`	`42`	`</ol>`
`43`	`43`
`44`		`-`
`45`	`44`	`## 解法`
`46`	`45`
`47`	`46`	`<!-- 这里可写通用的实现逻辑 -->`

`‎lcp/LCP 03. 机器人大冒险/README.md‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -47,7 +47,6 @@`
`47`	`47`	`<li><code>obstacles[i]</code>不为原点或者终点</li>`
`48`	`48`	`</ol>`
`49`	`49`
`50`		`-`
`51`	`50`	`## 解法`
`52`	`51`
`53`	`52`	`<!-- 这里可写通用的实现逻辑 -->`

`‎lcp/LCP 04. 覆盖/README.md‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -43,7 +43,6 @@`
`43`	`43`	`<li><code>0 <= b <= n * m</code></li>`
`44`	`44`	`</ol>`
`45`	`45`
`46`		`-`
`47`	`46`	`## 解法`
`48`	`47`
`49`	`48`	`<!-- 这里可写通用的实现逻辑 -->`

`‎lcp/LCP 05. 发 LeetCoin/README.md‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -68,7 +68,6 @@`
`68`	`68`	`<li><code>operations[i][0] != 3 时,1 <= operations[i][2] <= 5000</code></li>`
`69`	`69`	`</ol>`
`70`	`70`
`71`		`-`
`72`	`71`	`## 解法`
`73`	`72`
`74`	`73`	`<!-- 这里可写通用的实现逻辑 -->`

`‎lcp/LCP 06. 拿硬币/README.md‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -31,7 +31,6 @@`
`31`	`31`	`<li><code>1 <= coins[i] <= 10</code></li>`
`32`	`32`	`</ul>`
`33`	`33`
`34`		`-`
`35`	`34`	`## 解法`
`36`	`35`
`37`	`36`	`<!-- 这里可写通用的实现逻辑 -->`

`‎lcp/LCP 07. 传递信息/README.md‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -43,7 +43,6 @@`
`43`	`43`	`<li><code>0 <= relation[i][0],relation[i][1] < n 且 relation[i][0] != relation[i][1]</code></li>`
`44`	`44`	`</ul>`
`45`	`45`
`46`		`-`
`47`	`46`	`## 解法`
`48`	`47`
`49`	`48`	`<!-- 这里可写通用的实现逻辑 -->`

`‎lcp/LCP 08. 剧情触发时间/README.md‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -57,7 +57,6 @@`
`57`	`57`	`<li><code>0 <= requirements[i] <= 100000</code></li>`
`58`	`58`	`</ul>`
`59`	`59`
`60`		`-`
`61`	`60`	`## 解法`
`62`	`61`
`63`	`62`	`<!-- 这里可写通用的实现逻辑 -->`

`‎lcp/LCP 09. 最小跳跃次数/README.md‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -25,7 +25,6 @@`
`25`	`25`	`<li><code>1 <= jump[i] <= 10000</code></li>`
`26`	`26`	`</ul>`
`27`	`27`
`28`		`-`
`29`	`28`	`## 解法`
`30`	`29`
`31`	`30`	`<!-- 这里可写通用的实现逻辑 -->`

`‎lcp/LCP 10. 二叉树任务调度/README.md‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -51,7 +51,6 @@`
`51`	`51`	`<li><code>1 <= 单节点执行时间 <= 1000</code></li>`
`52`	`52`	`</ul>`
`53`	`53`
`54`		`-`
`55`	`54`	`## 解法`
`56`	`55`
`57`	`56`	`<!-- 这里可写通用的实现逻辑 -->`

0 commit comments

Comments

(0)