silence_iz的博客

CatalogureDescriptionThinkingCode Description Thinking Initial State: dp[0] = nums[0], dp[1] = nums[1]; State Transformation Equation: dp[i] = max{dp[i-1], dp[i-2]+nums[i]}; Code class Solution { pu...

CatalogueDescriptionThinkingState transformation equationCode Description Thinking State transformation equation dp[i] = max{num[i], dp[i-1]+dp[i-1]} Code class Solution { public: int maxSubArra...

CatalogueDescriptionThinkingCode Description Thinking Violent Solution Creating a two-dimensional array dp where dp[i][j] denotes the sum of the elements between indices i and j. Dynamic Programmi...

CatalogueDescriptionThinkingState: dp[i], dp[1] = false, dp[2] = true;Transformation equation：dp[i] = (N / j == 0 && dp[j]) ?? true : false;Code Description Thinking Let us assume a one-dimen...

CatalogueDescriptionThinkingCode Description Thinking Violent solution i traverses from 1 to n while j traverses from i-1 to 0. When j+1 equal to i, the default equal difference is A[i] - A[j], and ...

CatalogueDescriptionThinkingCode Description Thinking Tips: We will traverse both of two strings, if s1[i] != s2[j], we must delete one of them to minimize the ASCII. State: dp[i][j] denotes the mini...

CatalogueDescriptionThinkingCode Description Thinking Plan A (Two-dimensional, from top to bottom) State: dp[i][j] denotes whether the substring whose indices from i to j is a palindrom. Transformati...

CatalogueDescriptionThinking Description Thinking Plan A (Two-dimensional, from top to bottom) State: dp[i][j] denotes the minimum distance from top to triangle[i][j] Transformation equation : dp[i][...

CatalogueDescriptionThinkingCodeConclusion Description Thinking Sorry, I have no idea yet about how to solve this problem with a one-dimensional array right now. Maybe I’ll follow up at another time ...

CatalogueDescription_200_number-of-islandsDescription_547_friend-circlesThinkingCode Description_200_number-of-islands Description_547_friend-circles Thinking Something In Common Both of two questio...