Commit 0f5017b

committed

solves search in rotated sorted array II

1 parent 98095f7 commit 0f5017bCopy full SHA for 0f5017b

File tree

+13

-0

lines changed

+13

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -74,6 +74,7 @@`
`74`	`74`	`\| 78 \| [Subsets](https://leetcode.com/problems/subsets) \| [![Java](assets/java.png)](src/Subsets.java) \| \|`
`75`	`75`	`\| 79 \| [Word Search](https://leetcode.com/problems/word-search) \| [![Java](assets/java.png)](src/WordSearch.java) \| \|`
`76`	`76`	`\| 80 \| [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) \| [![Java](assets/java.png)](src/RemoveDuplicatesFromSortedArrayII.java) \| \|`
	`77`	`+\| 81 \| [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) \| [![Java](assets/java.png)](src/SearchInRotatedSortedArrayII.java) \| \|`
`77`	`78`	`\| 83 \| [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) \| [![Java](assets/java.png)](src/RemoveDuplicatesFromSortedList.java) [![Python](assets/python.png)](python/remove_duplicates_from_linked_list.py) \| \|`
`78`	`79`	`\| 88 \| [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) \| [![Java](assets/java.png)](src/MergeSortedArray.java) [![Python](assets/python.png)](python/merge_sorted_array.py) \| \|`
`79`	`80`	`\| 94 \| [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) \| [![Java](assets/java.png)](src/BinaryTreeInorderTraversal.java) [![Python](assets/python.png)](python/binary_tree_inorder_traversal.py) \| \|`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+// https://leetcode.com/problems/search-in-rotated-sorted-array-ii`
	`2`	`+// T: O(N)`
	`3`	`+// S: O(1)`
	`4`	`+`
	`5`	`+public class SearchInRotatedSortedArrayII {`
	`6`	`+ public boolean search(int[] nums, int target) {`
	`7`	`+ for (int element : nums) {`
	`8`	`+ if (element == target) return true;`
	`9`	`+ }`
	`10`	`+ return false;`
	`11`	`+ }`
	`12`	`+}`

Comments

(0)