704. Binary Search && 27. Remove Element

EchoNUIG

已于 2022-10-13 18:41:41 修改

阅读量149

点赞数

文章标签：算法数据结构 java

于 2022-10-13 18:34:55 首次发布

本文链接：https://blog.csdn.net/weixin_57706549/article/details/127306577

版权

704 : Problem Link: Loading...Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/binary-search/

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.

You must write an algorithm with O(log n) runtime complexity.


Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4

Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1
Explanation: 2 does not exist in nums so return -1

1: The first time I need to pay more attention to the time complex

2: Check spelling and code first before running code(some small mistakes like: wrong words, punctuation)

27: Problem Link:

Loading...Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/remove-element/

Input: nums = [3,2,2,3], val = 3
Output: 2, nums = [2,2,_,_]
Explanation: Your function should return k = 2, with the first two elements of nums being 2.
It does not matter what you leave beyond the returned k (hence they are underscores).

1: It is my first time to solve problem using bnary tree, and it is so fast and a little bit hard to understand.

2: Pay attetion to the scope of variable