lpomeloz

2019年6月4日

摘要： Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: 题目大意阅读全文

posted @ 2019-06-04 10:45 lpomeloz 阅读(121) 评论(0) 推荐(0)

letecode [38] - Count and Say

摘要： The count-and-say sequence is the sequence of integers with the first five terms as following: 1 is read off as "one 1" or 11.11 is read off as "two 1 阅读全文

posted @ 2019-06-04 09:47 lpomeloz 阅读(120) 评论(0) 推荐(0)

2019年6月3日

letecode [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 or 阅读全文

posted @ 2019-06-03 15:56 lpomeloz 阅读(98) 评论(0) 推荐(0)

letecode [28] - Implement strStr()

摘要： Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Example 1: Example 2: Cla 阅读全文

posted @ 2019-06-03 11:26 lpomeloz 阅读(109) 评论(0) 推荐(0)

letecode [27] - Remove Element

摘要： Given an array nums and a value val, remove all instances of that value in-place and return the new length. Do not allocate extra space for another ar 阅读全文

posted @ 2019-06-03 10:50 lpomeloz 阅读(231) 评论(0) 推荐(0)

letecode [26] - Remove Duplicates from Sorted Array

摘要： Share Share Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not alloca 阅读全文

posted @ 2019-06-03 10:31 lpomeloz 阅读(103) 评论(0) 推荐(0)

2019年5月30日

letecode [21] - Merge Two Sorted Lists

摘要： Merge 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. Example: 阅读全文

posted @ 2019-05-30 15:39 lpomeloz 阅读(101) 评论(0) 推荐(0)

letecode [20] - Valid Parentheses

摘要： Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: No 阅读全文

posted @ 2019-05-30 14:53 lpomeloz 阅读(114) 评论(0) 推荐(0)

2019年5月29日

leetcode [14] - Longest Common Prefix

摘要： Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Exampl 阅读全文

posted @ 2019-05-29 15:45 lpomeloz 阅读(130) 评论(0) 推荐(0)

letecode [13] - Roman to Integer

摘要： Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, two is written as II in Roman numeral, just two one's 阅读全文

posted @ 2019-05-29 13:21 lpomeloz 阅读(131) 评论(0) 推荐(0)

公告