Commit bc13e2e

committed

solves valid mountain array

1 parent 7b75389 commit bc13e2eCopy full SHA for bc13e2e

File tree

+59

-2

lines changed

+59

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -32,8 +32,8 @@`
`32`	`32`	`## Searching For Items In An Array`
`33`	`33`	`\| Question \| Solution \| Youtube \|`
`34`	`34`	`\|------\|:--------:\|:----------------------:\|`
`35`		`-\| [Check if N And It's Double Exists](https://leetcode.com/explore/learn/card/fun-with-arrays/527/searching-for-items-in-an-array/3250/) \| [![Java](assets/java.png)](java/src/) [![Python](assets/python.png)](python/) \|`
`36`		`-\| [Valid Mountain Array](https://leetcode.com/explore/learn/card/fun-with-arrays/527/searching-for-items-in-an-array/3251/) \| [![Java](assets/java.png)](java/src/) [![Python](assets/python.png)](python/) \|`
	`35`	`+\| [Check if N And It's Double Exists](https://leetcode.com/explore/learn/card/fun-with-arrays/527/searching-for-items-in-an-array/3250/) \| [![Java](assets/java.png)](java/src/CheckIfNAndItsDoubleExist.java) [![Python](assets/python.png)](python/check_if_n_and_its_double_exists.py) \|`
	`36`	`+\| [Valid Mountain Array](https://leetcode.com/explore/learn/card/fun-with-arrays/527/searching-for-items-in-an-array/3251/) \| [![Java](assets/java.png)](java/src/ValidMountainArray.java) [![Python](assets/python.png)](python/valid_mountain_array.py) \|`
`37`	`37`
`38`	`38`
`39`	`39`	`## In-Place Operations`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+import java.util.HashSet;`
	`2`	`+import java.util.Set;`
	`3`	`+`
	`4`	`+public class CheckIfNAndItsDoubleExist {`
	`5`	`+ public boolean checkIfExist(int[] array) {`
	`6`	`+ Set<Integer> elements = new HashSet<>();`
	`7`	`+ for(int element : array) {`
	`8`	`+ if (elements.contains(element * 2) \|\| (element % 2 == 0 && elements.contains(element / 2))) {`
	`9`	`+ return true;`
	`10`	`+ }`
	`11`	`+ elements.add(element);`
	`12`	`+ }`
	`13`	`+ return false;`
	`14`	`+ }`
	`15`	`+}`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+public class ValidMountainArray {`
	`2`	`+ public boolean validMountainArray(int[] arr) {`
	`3`	`+ boolean isIncreasing = true;`
	`4`	`+ for (int index = 1 ; index < arr.length ; index++) {`
	`5`	`+ if (arr[index] == arr[index - 1]) return false;`
	`6`	`+ if (arr[index] < arr[index - 1] && isIncreasing) {`
	`7`	`+ if (index == 1) return false;`
	`8`	`+ isIncreasing = false;`
	`9`	`+ } else if (arr[index] > arr[index - 1] && !isIncreasing) {`
	`10`	`+ return false;`
	`11`	`+ }`
	`12`	`+ }`
	`13`	`+ return !isIncreasing;`
	`14`	`+ }`
	`15`	`+}`

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,11 @@`
	`1`	`+from typing import List`
	`2`	`+`
	`3`	`+`
	`4`	`+class Solution:`
	`5`	`+ def checkIfExist(self, arr: List[int]) -> bool:`
	`6`	`+ elements = set()`
	`7`	`+ for number in arr:`
	`8`	`+ if 2 * number in elements or (number % 2 == 0 and number // 2 in elements):`
	`9`	`+ return True`
	`10`	`+ elements.add(number)`
	`11`	`+ return False`

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,16 @@`
	`1`	`+from typing import List`
	`2`	`+`
	`3`	`+`
	`4`	`+class Solution:`
	`5`	`+ def validMountainArray(self, numbers: List[int]) -> bool:`
	`6`	`+ isIncreasing = True`
	`7`	`+ index = 1`
	`8`	`+ while index < len(numbers):`
	`9`	`+ if numbers[index] == numbers[index - 1]: return False`
	`10`	`+ if numbers[index] < numbers[index - 1] and isIncreasing:`
	`11`	`+ if index == 1: return False`
	`12`	`+ isIncreasing = False`
	`13`	`+ if numbers[index] > numbers[index - 1] and not isIncreasing:`
	`14`	`+ return False`
	`15`	`+ index += 1`
	`16`	`+ return not isIncreasing`

Comments

(0)