关闭

LeetCode 477. Total Hamming Distance

LeetCode 477. Total Hamming Distance...
阅读(316) 评论(0)

LeetCode 456. 132 Pattern

LeetCode 456. 132 Pattern...
阅读(641) 评论(0)

LeetCode 446. Arithmetic Slices II - Subsequence

LeetCode 446. Arithmetic Slices II - Subsequence...
阅读(646) 评论(0)

LeetCode 452. Minimum Number of Arrows to Burst Balloons

LeetCode 452. Minimum Number of Arrows to Burst Balloons...
阅读(655) 评论(0)

LeetCode 179. Largest Number

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

LeetCode 174. Dungeon Game

LeetCode 174. Dungeon Game...
阅读(91) 评论(0)

LeetCode 173. Binary Search Tree Iterator

LeetCode 173. Binary Search Tree Iterator...
阅读(124) 评论(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 another expression. Some examples: ["2", "1", "+",...
阅读(457) 评论(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) { // IMPORTANT: Please reset any member data you declared...
阅读(508) 评论(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 declared, as // the same Solution instance will be reus...
阅读(307) 评论(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 member data you declared, as // the same Solutio...
阅读(398) 评论(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 the value (will always be positive) of the key if...
阅读(270) 评论(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 / 3 return [3,2,1]. public ArrayList pos...
阅读(348) 评论(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 / 3 return [1,2,3]. Note: Recursive soluti...
阅读(302) 评论(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. For example, Given {1,2,3,4}, reorder it to {1,4...
阅读(295) 评论(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 space? 点击打开链接 public ListNode detectCycle(ListNod...
阅读(370) 评论(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(ListNode head) { // IMPORTANT: Please reset any...
阅读(375) 评论(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 such possible sentences. For example, given s = "...
阅读(427) 评论(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. For example, given s = "leetcode", dict = ["leet"...
阅读(474) 评论(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 copy of the list. public RandomListNode copyRan...
阅读(424) 评论(0)
154条 共8页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:99479次
    • 积分:2706
    • 等级:
    • 排名:第13836名
    • 原创:178篇
    • 转载:21篇
    • 译文:0篇
    • 评论:9条
    文章分类
    最新评论