LeetCode
York_Yu
唯有不断学习才能更上时代。
展开
-
LeetCode:35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Here原创 2017-08-09 09:19:24 · 259 阅读 · 0 评论 -
LeetCode:38.Count and Say
Count and SayThe count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, …1 is read off as one 1 or 11. 11 is read off as two 1s or 21. 21 is read off as on原创 2017-08-10 17:59:34 · 341 阅读 · 0 评论 -
LeetCode:27. Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The order原创 2017-08-07 09:10:02 · 397 阅读 · 0 评论 -
LeetCode: 26. Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with cons原创 2017-08-04 10:23:50 · 348 阅读 · 0 评论 -
LeetCode: 21. Merge Two Sorted Lists
QuestionMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Definition for singly-linked list. * public原创 2017-08-03 10:38:06 · 493 阅读 · 0 评论 -
LeetCode:58 Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word does not exist, return 0. Note: A word is defin原创 2017-09-05 17:35:22 · 311 阅读 · 0 评论