Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commite06031b

Browse files
committed
move files
1 parent92d27ff commite06031b

File tree

4 files changed

+26
-2
lines changed

4 files changed

+26
-2
lines changed

‎Easy/167-twoSumII.js‎

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
/**
2+
*@param {number[]} numbers
3+
*@param {number} target
4+
*@return {number[]}
5+
*/
6+
vartwoSum=function(numbers,target){
7+
varleft=0;
8+
varright=numbers.length-1;
9+
varresults=[];
10+
11+
while(left<right){
12+
if(numbers[left]+numbers[right]===target){
13+
results.push(left+1,right+1);
14+
break;
15+
}elseif(numbers[left]+numbers[right]<target){
16+
left+=1;
17+
}else{
18+
right-=1;
19+
}
20+
}
21+
22+
returnresults;
23+
};
File renamed without changes.
File renamed without changes.

‎README.md‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -18,6 +18,7 @@
1818
*[27. Remove Element](https://leetcode.com/problems/remove-element/) -[Solution](./Easy/27-removeElement.js)
1919
*[36. Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) -[Solution](./Easy/36-validSudoku.js)
2020
*[38. Count and Say](https://leetcode.com/problems/count-and-say/) -[Solution](./Easy/38-countandSay.js)
21+
*[53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) -[Solution](./Easy/53-maximumSubarray.js)
2122
*[66. Plus One](https://leetcode.com/problems/plus-one/) -[Solution](./Easy/66-plusOne.js)
2223
*[67. Add Binary](https://leetcode.com/problems/add-binary/) -[Solution](./Easy/67-addBinary.js)
2324
*[70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) -[Solution](./Easy/70-climbChairs.js)
@@ -36,6 +37,7 @@
3637
*[125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) -[Solution](./Easy/125-validPalindrome.js)
3738
*[160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) -[Solution](./Easy/160-IntersectionofTwoLinkedLists.js)
3839
*[165. Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) -[Solution](./Easy/165-compareVersionNumbers.js)
40+
*[167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) -[Solution](./Easy/167-twoSummII.js)
3941
*[169. Majority Element](https://leetcode.com/problems/majority-element/) -[Solution](./Easy/169-majorityElement.js)
4042
*[172. Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) -[Solution](./Easy/172-factorialTrailingZeroes.js)
4143
*[190. Reverse Bits](https://leetcode.com/problems/reverse-bits/) -[Solution](./Easy/190-reverseBits.js)
@@ -87,6 +89,7 @@
8789
*[29. Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) -[Solution](./Medium/29-DivideTwoIntegers.js)
8890
*[31. Next Permutation](https://leetcode.com/problems/next-permutation/) -[Solution](./Medium/31-nextPermutation.js)
8991
*[31. Next Permutation](https://leetcode.com/problems/next-permutation/) -[Solution](./Medium/31-nextPermutation.js)
92+
*[33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) -[Solution](./Medium/33-searchRotatedSortedArray.js)
9093
*[34. Search for a Range](https://leetcode.com/problems/search-for-a-range/) -[Solution](./Medium/34-searchforRange.js)
9194
*[39. Combination Sum](https://oj.leetcode.com/problems/combination-sum/) -[Solution](./Medium/39-combinationSum.js)
9295
*[40. Combination Sum II](https://oj.leetcode.com/problems/combination-sum-ii/) -[Solution](./Medium/40-combinationSumII.js)
@@ -96,7 +99,6 @@
9699
*[48. Rotate Image](https://leetcode.com/problems/rotate-image/) -[Solution](./Medium/48-rotateImage.js)
97100
*[49. Group Anagrams](https://leetcode.com/problems/anagrams/) -[Solution](./Medium/49-groupAnagrams.js)
98101
*[50. Pow(x, n)](https://leetcode.com/problems/powx-n/) -[Solution](./Medium/50-powerxn.js)
99-
*[53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) -[Solution](./Medium/53-maximumSubarray.js)
100102
*[54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) -[Solution](./Medium/54-spiralMatrix.js)
101103
*[55. Jump Game](https://leetcode.com/problems/jump-game/) -[Solution](./Medium/55-jumpGame.js)
102104
*[59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) -[Solution](./Medium/59-spiralMatrixII.js)
@@ -183,7 +185,6 @@
183185
*[23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) -[Solution](./Hard/23-MergeKSortedLists.js)
184186
*[25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) -[Solution](./Hard/25-reverseNodesInKGroup.js)
185187
*[32. Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) -[Solution](./Hard/32-longestValidParentheses.js)
186-
*[33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) -[Solution](./Hard/33-searchRotatedSortedArray.js)
187188
*[41. First Missing Positive](https://leetcode.com/problems/first-missing-positive/) -[Solution](./Hard/41-firstMissingPositive.js)
188189
*[45. Jump Game II](https://leetcode.com/problems/jump-game-ii/) -[Solution](./Hard/45-jumpGameII.js)
189190
*[56. Merge Intervals](https://leetcode.com/problems/merge-intervals/) -[Solution](./Hard/56-MergeIntervals.js)

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp