Commit f743fc4

authored

chore: update lc problem: No.2140 (doocs#1315)

1 parent 93c47ce commit f743fc4Copy full SHA for f743fc4

File tree

-2

lines changed

solution
- 2100-2199/2140.Solving Questions With Brainpower
  - README.md
  - README_EN.md
- config.py

-2

lines changed

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,6 @@`
`12`	`12`
`13`	`13`	`<ul>`
`14`	`14`	`<li>比方说,给你 <code>questions = [[3, 2], [4, 3], [4, 4], [2, 5]]</code> :`
`15`		`-`
`16`	`15`	`<ul>`
`17`	`16`	`<li>如果问题 <code>0</code> 被解决了, 那么你可以获得 <code>3</code> 分,但你不能解决问题 <code>1</code> 和 <code>2</code> 。</li>`
`18`	`17`	`<li>如果你跳过问题 <code>0</code> ,且解决问题 <code>1</code> ,你将获得 <code>4</code> 分但是不能解决问题 <code>2</code> 和 <code>3</code> 。</li>`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -10,7 +10,6 @@`
`10`	`10`
`11`	`11`	`<ul>`
`12`	`12`	`<li>For example, given <code>questions = [[3, 2], [4, 3], [4, 4], [2, 5]]</code>:`
`13`		`-`
`14`	`13`	`<ul>`
`15`	`14`	`<li>If question <code>0</code> is solved, you will earn <code>3</code> points but you will be unable to solve questions <code>1</code> and <code>2</code>.</li>`
`16`	`15`	`<li>If instead, question <code>0</code> is skipped and question <code>1</code> is solved, you will earn <code>4</code> points but you will be unable to solve questions <code>2</code> and <code>3</code>.</li>`

Lines changed: 1 addition & 0 deletions

Comments

(0)