上一页 1 2 3 4 5 6 ··· 13 下一页
摘要: Given a linked list, return the node where the cycle begins. If there is no cycle, return null. To represent a cycle in the given linked list, we use 阅读全文
posted @ 2019-05-31 19:16 GoodRnne 阅读(490) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequ 阅读全文
posted @ 2019-05-30 17:15 GoodRnne 阅读(897) 评论(0) 推荐(0) 编辑
摘要: There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the following re 阅读全文
posted @ 2019-05-29 19:59 GoodRnne 阅读(696) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note: Your al 阅读全文
posted @ 2019-05-27 16:58 GoodRnne 阅读(209) 评论(0) 推荐(0) 编辑
摘要: There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs 阅读全文
posted @ 2019-05-26 11:43 GoodRnne 阅读(325) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runti 阅读全文
posted @ 2019-05-26 11:18 GoodRnne 阅读(181) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path1->2->3 which 阅读全文
posted @ 2019-05-24 19:17 GoodRnne 阅读(163) 评论(0) 推荐(0) 编辑
摘要: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Your algorithm should run in O(n) complexity. Examp 阅读全文
posted @ 2019-05-24 19:01 GoodRnne 阅读(294) 评论(0) 推荐(0) 编辑
摘要: Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, 阅读全文
posted @ 2019-05-23 19:45 GoodRnne 阅读(198) 评论(0) 推荐(0) 编辑
摘要: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. Note: For the purpose of this problem, w 阅读全文
posted @ 2019-05-22 20:30 GoodRnne 阅读(147) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 ··· 13 下一页