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

Author: thinkasany

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

@@ -12,7 +12,6 @@
 
 <ul>
 	<li>比方说，给你&nbsp;<code>questions = [[3, 2], [4, 3], [4, 4], [2, 5]]</code>&nbsp;：
-
     <ul>
     	<li>如果问题&nbsp;<code>0</code>&nbsp;被解决了， 那么你可以获得&nbsp;<code>3</code>&nbsp;分，但你不能解决问题&nbsp;<code>1</code> 和&nbsp;<code>2</code>&nbsp;。</li>
     	<li>如果你跳过问题&nbsp;<code>0</code>&nbsp;，且解决问题&nbsp;<code>1</code>&nbsp;，你将获得 <code>4</code> 分但是不能解决问题&nbsp;<code>2</code> 和&nbsp;<code>3</code>&nbsp;。</li>

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

@@ -10,7 +10,6 @@
 
 <ul>
 	<li>For example, given <code>questions = [[3, 2], [4, 3], [4, 4], [2, 5]]</code>:
-
     <ul>
     	<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>
     	<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>

solution/config.py

@@ -55,6 +55,7 @@
     2043,
     2111,
     2117,
+    2140,
     2178,
     2241,
     2288,