上一页 1 2 3 4 5 6 ··· 25 下一页
摘要: 33. Search in Rotated Sorted Array Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 阅读全文
posted @ 2017-10-21 16:22 hdu胡恩超 阅读(185) 评论(0) 推荐(0) 编辑
摘要: 32. Longest Valid Parentheses Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parenthese 阅读全文
posted @ 2017-10-21 11:35 hdu胡恩超 阅读(161) 评论(0) 推荐(0) 编辑
摘要: 31. Next Permutation Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arra 阅读全文
posted @ 2017-10-20 19:51 hdu胡恩超 阅读(176) 评论(0) 推荐(0) 编辑
摘要: 30. Substring with Concatenation of All Words You are given a string, s, and a list of words, words, that are all of the same length. Find all startin 阅读全文
posted @ 2017-10-20 14:46 hdu胡恩超 阅读(204) 评论(0) 推荐(0) 编辑
摘要: 29. Divide Two Integers Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 这题真的无能为力,js写法一 阅读全文
posted @ 2017-10-20 01:41 hdu胡恩超 阅读(142) 评论(0) 推荐(0) 编辑
摘要: 28. Implement strStr() Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 阅读全文
posted @ 2017-10-18 17:11 hdu胡恩超 阅读(164) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2017-10-18 12:28 hdu胡恩超 阅读(150) 评论(0) 推荐(0) 编辑
摘要: 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 ne 阅读全文
posted @ 2017-10-18 12:20 hdu胡恩超 阅读(111) 评论(0) 推荐(0) 编辑
摘要: 25. Reverse Nodes in k-Group Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer 阅读全文
posted @ 2017-10-18 11:21 hdu胡恩超 阅读(128) 评论(0) 推荐(0) 编辑
摘要: 24. Swap Nodes in Pairs Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the li 阅读全文
posted @ 2017-10-17 21:50 hdu胡恩超 阅读(136) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 ··· 25 下一页