feat: Blind75

Author: kimi0230

Leetcode/0053.Maximum-Subarray/README.md

@@ -1,9 +1,64 @@
 ---
 title: 0053.Maximum Subarray
-tags: Easy, Dynamic Programming
-author: Kimi Tsai <[email protected]>
-description:
+subtitle: "https://leetcode.com/problems/maximum-subarray"
+date: 2024-02-23T25:04:00+08:00
+lastmod: 2024-02-23T25:04:00+08:00
+draft: false
+author: "Kimi.Tsai"
+authorLink: "https://kimi0230.github.io/"
+description: "0053.Maximum-Subarray"
+license: ""
+images: []
+
+tags: [LeetCode, Go, Medium, Array, Dynamic Programming, Blind75]
+categories: [LeetCode]
+
+featuredImage: ""
+featuredImagePreview: ""
+
+hiddenFromHomePage: false
+hiddenFromSearch: false
+twemoji: false
+lightgallery: true
+ruby: true
+fraction: true
+fontawesome: true
+linkToMarkdown: false
+rssFullText: false
+
+toc:
+  enable: true
+  auto: true
+code:
+  copy: true
+  maxShownLines: 200
+math:
+  enable: false
+  # ...
+mapbox:
+  # ...
+share:
+  enable: true
+  # ...
+comment:
+  enable: true
+  # ...
+library:
+  css:
+    # someCSS = "some.css"
+    # located in "assets/"
+    # Or
+    # someCSS = "https://cdn.example.com/some.css"
+  js:
+    # someJS = "some.js"
+    # located in "assets/"
+    # Or
+    # someJS = "https://cdn.example.com/some.js"
+seo:
+  images: []
+  # ...
 ---
+
 # [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)
 
 ## 題目
@@ -20,7 +75,7 @@ If you have figured out the O(*n*) solution, try coding another solution using t
 
 ## 題目大意
 
-給定一個整數數組 nums ，找到一個具有最大和的連續子數組（子數組最少包含一個元素），返回其最大和。
+給定一個整數數組 nums ，找到一個具有**最大和的連續子數組**（子數組最少包含一個元素），返回其最大和。
 
 ## 解題思路
 

Leetcode/0217.Contains-Duplicate/README.md

@@ -10,7 +10,7 @@ description: "Contains Duplicate"
 license: ""
 images: []
 
-tags: [LeetCode, Go, Easy, Contains Duplicate]
+tags: [LeetCode, Go, Easy, Contains Duplicate, Array, Blind75]
 categories: [LeetCode]
 
 featuredImage: ""

Leetcode/0238.Product-of-Array-Except-Self/README.md

@@ -10,7 +10,7 @@ description: "0238.Product-of-Array-Except-Self"
 license: ""
 images: []
 
-tags: [LeetCode, Go, Medium, Product of Array Except Self, Array, Prefix Sum]
+tags: [LeetCode, Go, Medium, Product of Array Except Self, Array, Prefix Sum, Blind75]
 categories: [LeetCode]
 
 featuredImage: ""