Commit 9781f8c

committed

Updated README.md and docs/index.md.

1 parent 71ba246 commit 9781f8cCopy full SHA for 9781f8c

File tree

+31

-4

lines changed

+31

-4

lines changed

Lines changed: 7 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -90,14 +90,20 @@ The format of the .test files are as follows:`
`90`	`90`	`<expected results>`
`91`	`91`	```
`92`	`92`
`93`		`-Each line is either an integral type, a string, or an array. For example:`
	`93`	`+The supported types are: integral type, a string, TreeNode structure, boolean or an array. For example:`
`94`	`94`
`95`	`95`	```text
`96`	`96`	`["1", "2", "4"]`
`97`	`97`	`8.0`
`98`	`98`	`[0, 0]`
`99`	`99`	```
`100`	`100`
	`101`	+A ThreeNode structure is represented in an array-based structure. For example an array representation `[1, 2, null, null, 3]` results to the following structure:
	`102`	`+`
	`103`	`+ 1`
	`104`	`+ / \`
	`105`	`+ 2 3`
	`106`	`+`
`101`	`107`	`## List of LeetCode Problems`
`102`	`108`	`* TwoSum`
`103`	`109`	`* LongestSubstringWithoutRepeatingCharacters`

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,11 +7,27 @@ A complete binary tree is characterized by each level being fully filled except`
`7`	`7`	`\`
`8`	`8`	`\`
`9`	`9`	`Example 1:`
	`10`	`+`
	`11`	`+ 1`
	`12`	`+ / \`
	`13`	`+ / \`
	`14`	`+ 2 3`
	`15`	`+ / \ /`
	`16`	`+ 4 5 6`
	`17`	`+`
`10`	`18`	`>Input: root = [1,2,3,4,5,6]\`
`11`	`19`	`>Output: true\`
`12`	`20`	`>Explanation: All levels preceding the final one are completely filled (for instance, levels with node-values {1} and {2, 3}), and all nodes in the last level ({4, 5, 6}) are aligned to the left as much as possible.`
`13`	`21`
`14`	`22`	`Example 2:`
	`23`	`+`
	`24`	`+ 1`
	`25`	`+ / \`
	`26`	`+ / \`
	`27`	`+ 2 3`
	`28`	`+ / \ \`
	`29`	`+ 4 5 7`
	`30`	`+`
`15`	`31`	`>Input: root = [1,2,3,4,5,null,7]\`
`16`	`32`	`>Output: false\`
`17`	`33`	`>Explanation: The node with value 7 isn't as far left as possible.`

Lines changed: 8 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -4,9 +4,14 @@ Welcome to the OpenLeetCode Project! This guide will describe how to add support`
`4`	`4`
`5`	`5`	`## Table of Contents`
`6`	`6`
`7`		`-1. [Adding support for a new language](#adding-support-for-a-new-language)`
`8`		`-2. [Building and Running the Testcases](#building-and-running-the-testcases)`
`9`		`-3. [Schema Validation](#schema-validation)`
	`7`	`+- [Getting Started](#getting-started)`
	`8`	`+ - [Table of Contents](#table-of-contents)`
	`9`	`+ - [Adding support for a new language](#adding-support-for-a-new-language)`
	`10`	`+ - [Building and Running the Testcases](#building-and-running-the-testcases)`
	`11`	`+ - [Setup](#setup)`
	`12`	`+ - [Build and Run](#build-and-run)`
	`13`	`+ - [The Results](#the-results)`
	`14`	`+ - [Schema Validation](#schema-validation)`
`10`	`15`
`11`	`16`	`## Adding support for a new language`
`12`	`17`

Comments

(0)