Skip to content

Commit 2f81c69

Browse files
committed
✨ feat: 53 && 35;
1 parent f533a9e commit 2f81c69

File tree

3 files changed

+37
-1
lines changed

3 files changed

+37
-1
lines changed

35-search-insert-position.js

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
/**
2+
* @param {number[]} nums
3+
* @param {number} target
4+
* @return {number}
5+
*/
6+
var searchInsert = function(nums, target) {
7+
let index = 0;
8+
if (nums[nums.length - 1] < target) {
9+
return nums.length;
10+
}
11+
for (let i = 0; i < nums.length; i++) {
12+
if (nums[i] === target || nums[i] > target) {
13+
index = i;
14+
break;
15+
}
16+
}
17+
return index;
18+
};

53-maximum-subarray.js

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
/**
2+
* @param {number[]} nums
3+
* @return {number}
4+
*/
5+
var maxSubArray = function(nums) {
6+
let res = nums[0];
7+
let sum = 0;
8+
for (let i = 0; i < nums.length; i++) {
9+
if (sum + nums[i] > nums[i]) {
10+
sum = sum + nums[i];
11+
} else {
12+
sum = nums[i];
13+
}
14+
res = Math.max(res, sum);
15+
}
16+
return res;
17+
};

README.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
11
Record LeetCode.
2-
2+
[53. 最大子序和](./53-maximum-subarray.js)
3+
[35. 搜索插入位置](./35-search-insert-position.js)
34
[1512. 好数对的数目](./1512-number-of-good-pairs.js)
45
[771. 宝石与石头](./771-jewels-and-stones.js)
56
[82. 删除排序链表中的重复元素II](./82-remove-duplicates-from-sorted-list-ii.js)

0 commit comments

Comments
 (0)