fix little typos

64json · 64json · commit 540d11f004e7 · 2016-05-26T05:17:44.000-05:00
diff --git a/algorithm/dp/fibonacci/desc.json b/algorithm/dp/fibonacci/desc.json
@@ -1,7 +1,7 @@
 {
-  "Fivonacci": "Finding fibonacci sequence using dynamic programming.",
+  "Fibonacci Sequence": "Finding Fibonacci sequence using dynamic programming.",
   "Complexity": {
-    "time": "O(n<sup>2</sup>",
+    "time": "O(n<sup>2</sup>)",
     "space": "O(n)"
   },
   "References": [
diff --git a/algorithm/dp/knapsack_problem/desc.json b/algorithm/dp/knapsack_problem/desc.json
@@ -1,5 +1,5 @@
 {
-  "Knapsack problem": "Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.",
+  "Knapsack Problem": "Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.",
   "Complexity": {
     "time": "O(n<sup>2</sup>",
     "space": "O(n<sup>2</sup>)"
diff --git a/algorithm/dp/longest_increasing_subsequence/desc.json b/algorithm/dp/longest_increasing_subsequence/desc.json
@@ -1,5 +1,5 @@
 {
-  "Longest increasing subsequence": "Find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order",
+  "Longest Increasing Subsequence": "Find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order",
   "Complexity": {
     "time": "O(n(log n))",
     "space": "O(n)"
diff --git a/algorithm/dp/max_subarray/desc.json b/algorithm/dp/max_subarray/desc.json
@@ -1,5 +1,5 @@
 {
-  "Maximum subarray": "Find the sum of the maximum Subarray in the given Array",
+  "Maximum Subarray": "Find the sum of the maximum Subarray in the given Array",
   "Complexity": {
     "time": "O(n)",
     "space": "O(n)"
diff --git a/algorithm/dp/max_sum_path/desc.json b/algorithm/dp/max_sum_path/desc.json
@@ -1,11 +1,10 @@
 {
-  "Maximum sum path": "Finding the maximum sum in a path from (0, 0) to (N-1, M-1) when can only move to right or down",
+  "Maximum Sum Path": "Finding the maximum sum in a path from (0, 0) to (N-1, M-1) when can only move to right or down",
   "Complexity": {
     "time": "O(n)",
     "space": "O(n)"
   },
   "References": [
-    "<a href='https://en.wikipedia.org/'>Wikipedia</a>"
   ],
   "files": {
     "basic": "Maximum sum path"
diff --git a/algorithm/dp/sliding_window/desc.json b/algorithm/dp/sliding_window/desc.json
@@ -1,13 +1,12 @@
 {
-  "Sliding window": "Finding the largest sum of three contiguous number",
+  "Sliding Window": "Finding the largest sum of three contiguous number",
   "Complexity": {
     "time": "O(n)",
     "space": "O(n)"
   },
   "References": [
-    "<a href='https://en.wikipedia.org/'>Wikipedia</a>"
   ],
   "files": {
-    "basic": "Sliding windows"
+    "basic": "Sliding window"
   }
 }

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`{`
`2`		`- "Knapsack problem": "Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.",`
	`2`	`+ "Knapsack Problem": "Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.",`
`3`	`3`	`"Complexity": {`
`4`	`4`	`"time": "O(n<sup>2</sup>",`
`5`	`5`	`"space": "O(n<sup>2</sup>)"`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`{`
`2`		`- "Longest increasing subsequence": "Find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order",`
	`2`	`+ "Longest Increasing Subsequence": "Find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order",`
`3`	`3`	`"Complexity": {`
`4`	`4`	`"time": "O(n(log n))",`
`5`	`5`	`"space": "O(n)"`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`{`
`2`		`- "Maximum subarray": "Find the sum of the maximum Subarray in the given Array",`
	`2`	`+ "Maximum Subarray": "Find the sum of the maximum Subarray in the given Array",`
`3`	`3`	`"Complexity": {`
`4`	`4`	`"time": "O(n)",`
`5`	`5`	`"space": "O(n)"`
Original file line number	Diff line number	Diff line change
`@@ -1,13 +1,12 @@`
`1`	`1`	`{`
`2`		`- "Sliding window": "Finding the largest sum of three contiguous number",`
	`2`	`+ "Sliding Window": "Finding the largest sum of three contiguous number",`
`3`	`3`	`"Complexity": {`
`4`	`4`	`"time": "O(n)",`
`5`	`5`	`"space": "O(n)"`
`6`	`6`	`},`
`7`	`7`	`"References": [`
`8`		`- "<a href='https://en.wikipedia.org/'>Wikipedia</a>"`
`9`	`8`	`],`
`10`	`9`	`"files": {`
`11`		`- "basic": "Sliding windows"`
	`10`	`+ "basic": "Sliding window"`
`12`	`11`	`}`
`13`	`12`	`}`