Commit 30a80e1

authored

fix format

1 parent 63edc36 commit 30a80e1Copy full SHA for 30a80e1

File tree

-0

lines changed

-0

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -29,6 +29,7 @@ if count > 1. Return the length of new array at the end.`
`29`	`29`	`[Submission](https://github.com/kanglicheng/python-leetcode/blob/mySolutions/Kangli/Strings/stringCompression.py)`
`30`	`30`
`31`	`31`	`10/27/17`
	`32`	`+`
`32`	`33`	`219: Contains Duplicate II- Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.`
`33`	`34`	`Thoughts:`
`34`	`35`	`Use a dictionary to store each integer and its index in nums as key, value pairs.`
`@@ -50,6 +51,7 @@ Thoughts: Using a dictionary (hash), insert each sorted string into the dictiona`
`50`	`51`	`[Submission](https://github.com/kanglicheng/python-leetcode/blob/mySolutions/Kangli/Hash%20Table/group_anagrams.py)`
`51`	`52`
`52`	`53`	`11/7/17`
	`54`	`+`
`53`	`55`	`206: Reverse Linked List`
`54`	`56`	`Have access to the head of the linked list. Want to reverse the pointers and make the original head point to null (end of list).`
`55`	`57`	`1) Recursively, we begin with the base case of returning head if head is null or head.next is null.`

Comments

(0)