LeetCode刷题记
Young-Z-Wang
这个作者很懒,什么都没留下…
展开
-
LeetCode | Reverse Words in a String
原题描述: Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". 实现思路: 1. 使用zheng'c原创 2014-05-04 22:00:50 · 624 阅读 · 0 评论 -
LeetCode | Single Number
原题描述:https://oj.leetcode.com/problems/single-number/ Given an array of integers, every element appears twice except for one. Find that single one. 解题思路:原创 2014-07-14 19:21:59 · 671 阅读 · 0 评论 -
LeetCode | Linked List Cycle
原题描述:原创 2014-06-20 20:50:41 · 713 阅读 · 0 评论 -
LeetCode | Reorder List
原题描述:https://oj.leetcode.com/problems/reorder-list/原创 2014-06-20 20:17:41 · 537 阅读 · 0 评论 -
LeetCode | Copy List with Random Pointer
原题描述:https://oj.leetcode.com/problems/copy-list-with-random-pointer/原创 2014-07-10 14:56:55 · 797 阅读 · 0 评论 -
LeetCode | Sort List
原题描述: Sort a linked list in O(n log n) time using constant space complexity. 实现思路: 题目要求 O(n*lgn)的是时间复杂度和常数时间原创 2014-05-21 15:47:48 · 721 阅读 · 0 评论 -
LeetCode | Binary Tree Traversal
原题描述: 实现二叉树的遍历。原创 2014-06-13 09:02:56 · 748 阅读 · 0 评论 -
LeetCode | Word Break
原题描述: Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = "leetcode", dict原创 2014-07-02 21:28:47 · 666 阅读 · 0 评论 -
LeetCode | Word Break II
原题描述:https://oj.leetcode.com/problems/word-break-ii/ Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return原创 2014-07-02 21:37:21 · 719 阅读 · 0 评论 -
LeetCode | LRU Cache
原题描述: Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the value (will always be positive) of原创 2014-06-10 11:07:35 · 658 阅读 · 0 评论 -
LeetCode | Max Points on a Line
/** * Definition for a point. * class Point { * int x; * int y; * Point() { x = 0; y = 0; } * Point(int a, int b) { x = a; y = b; } * } */ public class Solution { private s原创 2014-05-04 20:57:00 · 594 阅读 · 0 评论 -
LeetCode | Evaluate Reverse Polish Notation
原题描述: Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". 实现思路:原创 2014-05-04 21:46:02 · 523 阅读 · 0 评论 -
LeetCode | Insertion Sort List
原题描述: Have you been asked this question in an interview?原创 2014-05-22 14:28:34 · 757 阅读 · 0 评论 -
LeetCode | Single Number II
原题描述:https://oj.leetcode.com/problems/single-number-ii/原创 2014-07-14 21:15:05 · 825 阅读 · 0 评论