Commit 10277cb

authored

feat: update solutions to lc problem: No.1039 (#4755)

1 parent 2a02977 commit 10277cbCopy full SHA for 10277cb

File tree

+15

-24

lines changed

+15

-24

lines changed

Lines changed: 4 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -148,9 +148,8 @@ class Solution {`
`148`	`148`	`public:`
`149`	`149`	`int minScoreTriangulation(vector<int>& values) {`
`150`	`150`	`int n = values.size();`
`151`		`- int f[n][n];`
`152`		`- memset(f, 0, sizeof(f));`
`153`		`- function<int(int, int)> dfs = [&](int i, int j) -> int {`
	`151`	`+ vector<vector<int>> f(n, vector<int>(n));`
	`152`	`+ auto dfs = [&](this auto&& dfs, int i, int j) -> int {`
`154`	`153`	`if (i + 1 == j) {`
`155`	`154`	`return 0;`
`156`	`155`	`}`
`@@ -302,8 +301,7 @@ class Solution {`
`302`	`301`	`public:`
`303`	`302`	`int minScoreTriangulation(vector<int>& values) {`
`304`	`303`	`int n = values.size();`
`305`		`- int f[n][n];`
`306`		`- memset(f, 0, sizeof(f));`
	`304`	`+ vector<vector<int>> f(n, vector<int>(n));`
`307`	`305`	`for (int i = n - 3; i >= 0; --i) {`
`308`	`306`	`for (int j = i + 2; j < n; ++j) {`
`309`	`307`	`f[i][j] = 1 << 30;`
`@@ -413,8 +411,7 @@ class Solution {`
`413`	`411`	`public:`
`414`	`412`	`int minScoreTriangulation(vector<int>& values) {`
`415`	`413`	`int n = values.size();`
`416`		`- int f[n][n];`
`417`		`- memset(f, 0, sizeof(f));`
	`414`	`+ vector<vector<int>> f(n, vector<int>(n));`
`418`	`415`	`for (int l = 3; l <= n; ++l) {`
`419`	`416`	`for (int i = 0; i + l - 1 < n; ++i) {`
`420`	`417`	`int j = i + l - 1;`

Lines changed: 4 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -152,9 +152,8 @@ class Solution {`
`152`	`152`	`public:`
`153`	`153`	`int minScoreTriangulation(vector<int>& values) {`
`154`	`154`	`int n = values.size();`
`155`		`- int f[n][n];`
`156`		`- memset(f, 0, sizeof(f));`
`157`		`- function<int(int, int)> dfs = [&](int i, int j) -> int {`
	`155`	`+ vector<vector<int>> f(n, vector<int>(n));`
	`156`	`+ auto dfs = [&](this auto&& dfs, int i, int j) -> int {`
`158`	`157`	`if (i + 1 == j) {`
`159`	`158`	`return 0;`
`160`	`159`	`}`
`@@ -306,8 +305,7 @@ class Solution {`
`306`	`305`	`public:`
`307`	`306`	`int minScoreTriangulation(vector<int>& values) {`
`308`	`307`	`int n = values.size();`
`309`		`- int f[n][n];`
`310`		`- memset(f, 0, sizeof(f));`
	`308`	`+ vector<vector<int>> f(n, vector<int>(n));`
`311`	`309`	`for (int i = n - 3; i >= 0; --i) {`
`312`	`310`	`for (int j = i + 2; j < n; ++j) {`
`313`	`311`	`f[i][j] = 1 << 30;`
`@@ -417,8 +415,7 @@ class Solution {`
`417`	`415`	`public:`
`418`	`416`	`int minScoreTriangulation(vector<int>& values) {`
`419`	`417`	`int n = values.size();`
`420`		`- int f[n][n];`
`421`		`- memset(f, 0, sizeof(f));`
	`418`	`+ vector<vector<int>> f(n, vector<int>(n));`
`422`	`419`	`for (int l = 3; l <= n; ++l) {`
`423`	`420`	`for (int i = 0; i + l - 1 < n; ++i) {`
`424`	`421`	`int j = i + l - 1;`

Lines changed: 3 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,9 +2,8 @@ class Solution {`
`2`	`2`	`public:`
`3`	`3`	`int minScoreTriangulation(vector<int>& values) {`
`4`	`4`	`int n = values.size();`
`5`		`- int f[n][n];`
`6`		`- memset(f, 0, sizeof(f));`
`7`		`- function<int(int, int)> dfs = [&](int i, int j) -> int {`
	`5`	`+ vector<vector<int>> f(n, vector<int>(n));`
	`6`	`+ auto dfs = [&](this auto&& dfs, int i, int j) -> int {`
`8`	`7`	`if (i + 1 == j) {`
`9`	`8`	`return 0;`
`10`	`9`	`}`
`@@ -19,4 +18,4 @@ class Solution {`
`19`	`18`	`};`
`20`	`19`	`return dfs(0, n - 1);`
`21`	`20`	`}`
`22`		`-};`
	`21`	`+};`

Lines changed: 2 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,8 +2,7 @@ class Solution {`
`2`	`2`	`public:`
`3`	`3`	`int minScoreTriangulation(vector<int>& values) {`
`4`	`4`	`int n = values.size();`
`5`		`- int f[n][n];`
`6`		`- memset(f, 0, sizeof(f));`
	`5`	`+ vector<vector<int>> f(n, vector<int>(n));`
`7`	`6`	`for (int i = n - 3; i >= 0; --i) {`
`8`	`7`	`for (int j = i + 2; j < n; ++j) {`
`9`	`8`	`f[i][j] = 1 << 30;`
`@@ -14,4 +13,4 @@ class Solution {`
`14`	`13`	`}`
`15`	`14`	`return f[0][n - 1];`
`16`	`15`	`}`
`17`		`-};`
	`16`	`+};`

Lines changed: 2 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,8 +2,7 @@ class Solution {`
`2`	`2`	`public:`
`3`	`3`	`int minScoreTriangulation(vector<int>& values) {`
`4`	`4`	`int n = values.size();`
`5`		`- int f[n][n];`
`6`		`- memset(f, 0, sizeof(f));`
	`5`	`+ vector<vector<int>> f(n, vector<int>(n));`
`7`	`6`	`for (int l = 3; l <= n; ++l) {`
`8`	`7`	`for (int i = 0; i + l - 1 < n; ++i) {`
`9`	`8`	`int j = i + l - 1;`
`@@ -15,4 +14,4 @@ class Solution {`
`15`	`14`	`}`
`16`	`15`	`return f[0][n - 1];`
`17`	`16`	`}`
`18`		`-};`
	`17`	`+};`

Comments

(0)