Commitb4d8d47

zongyanqi

committed

add Easy_35_Search_Insert_Position

1 parent63a956c commitb4d8d47Copy full SHA for b4d8d47

File tree

+41

-0

lines changed

+41

-0

lines changed

Lines changed: 41 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,41 @@`
	`1`	`+/**`
	`2`	`+ * Given a sorted array and a target value, return the index if the target is found.`
	`3`	`+ * If not, return the index where it would be if it were inserted in order.`
	`4`	`+ *`
	`5`	`+ * You may assume no duplicates in the array.`
	`6`	`+ *`
	`7`	`+ * Here are few examples.`
	`8`	`+ * [1,3,5,6], 5 → 2`
	`9`	`+ * [1,3,5,6], 2 → 1`
	`10`	`+ * [1,3,5,6], 7 → 4`
	`11`	`+ * [1,3,5,6], 0 → 0`
	`12`	`+ */`
	`13`	`+`
	`14`	`+/**`
	`15`	`+ *@param {number[]} nums`
	`16`	`+ *@param {number} target`
	`17`	`+ *@return {number}`
	`18`	`+ */`
	`19`	`+varsearchInsert=function(nums,target){`
	`20`	`+`
	`21`	`+varindex=0;`
	`22`	`+for(vari=0;i<nums.length;i++){`
	`23`	`+vartemp=nums[i];`
	`24`	`+if(target===temp){`
	`25`	`+returni;`
	`26`	`+}`
	`27`	`+elseif(target>temp){`
	`28`	`+index++;`
	`29`	`+}else{`
	`30`	`+returnindex;`
	`31`	`+}`
	`32`	`+}`
	`33`	`+returnindex;`
	`34`	`+`
	`35`	`+};`
	`36`	`+`
	`37`	`+console.log(searchInsert([1,3,5,6],5)==2);`
	`38`	`+console.log(searchInsert([1,3,5,6],2)==1);`
	`39`	`+console.log(searchInsert([1,3,5,6],7)==4);`
	`40`	`+console.log(searchInsert([1,3,5,6],0)==0);`
	`41`	`+console.log(searchInsert([1,3,5,6],100)==4);`

Comments

(0)