LeetCode 477. Total Hamming Distance

LeetCode 477. Total Hamming Distance

2016-12-24 14:37:11

阅读数:420

评论数:0

LeetCode 456. 132 Pattern

LeetCode 456. 132 Pattern

2016-11-21 20:29:58

阅读数:999

评论数:1

LeetCode 446. Arithmetic Slices II - Subsequence

LeetCode 446. Arithmetic Slices II - Subsequence

2016-11-17 10:13:14

阅读数:914

评论数:0

LeetCode 452. Minimum Number of Arrows to Burst Balloons

LeetCode 452. Minimum Number of Arrows to Burst Balloons

2016-11-11 16:09:17

阅读数:1215

评论数:0

LeetCode 179. Largest Number

LeetCode 179. Largest Number 给出一个非负整型列表,对列表里的整型进行排序,使得排序后将这些数字连在一起的数字最大。

2016-11-08 11:42:18

阅读数:219

评论数:0

LeetCode 174. Dungeon Game

LeetCode 174. Dungeon Game

2016-11-01 14:28:04

阅读数:143

评论数:0

LeetCode 173. Binary Search Tree Iterator

LeetCode 173. Binary Search Tree Iterator

2016-11-01 14:26:41

阅读数:199

评论数:0

CODE 147: Evaluate Reverse Polish Notation

Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or anoth...

2013-11-28 22:23:01

阅读数:496

评论数:0

CODE 146: Max Points on a Line

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. public int maxPoints(Point[] points) { // I...

2013-11-28 22:16:20

阅读数:555

评论数:0

CODE 144: Insertion Sort List

Sort a linked list using insertion sort. public ListNode insertionSortList(ListNode head) { // IMPORTANT: Please reset any member data you declar...

2013-11-27 19:56:56

阅读数:346

评论数:0

CODE 145: Sort List

Sort a linked list in O(n log n) time using constant space complexity. public ListNode sortList(ListNode head) { // IMPORTANT: Please reset any...

2013-11-26 22:35:50

阅读数:491

评论数:0

CODE 143: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 t...

2013-11-26 21:38:45

阅读数:312

评论数:0

CODE 142: Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / ...

2013-11-25 22:37:26

阅读数:377

评论数:0

CODE 141: Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / ...

2013-11-25 22:15:33

阅读数:382

评论数:0

CODE 140: Reorder List

Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values....

2013-11-25 20:37:24

阅读数:334

评论数:0

CODE 139: Linked List Cycle II

Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra spa...

2013-11-24 22:01:49

阅读数:421

评论数:0

CODE 138: Linked List Cycle

Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? public boolean hasCycle(List...

2013-11-24 16:07:29

阅读数:400

评论数:0

CODE 137: 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 all su...

2013-11-24 15:50:21

阅读数:509

评论数:0

CODE 136: 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. ...

2013-11-23 21:22:58

阅读数:693

评论数:0

CODE 135: Copy List with Random Pointer

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep ...

2013-11-23 18:11:06

阅读数:513

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭