题目描述：
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the ...
档案日期2015的28
2015年7月13日 - 2015年7月19日
[LeetCode]Sliding Window Maximum
[LeetCode]Word Break
作者是
发布于
在
LeetCode.
题目描述：
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", "code"].
Return true because ...
[LeetCode]Product of Array Except Self
作者是
发布于
在
LeetCode.
题目描述：
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].
Solve it without division and in O(n).
For ...
[LeetCode]Delete Node in a Linked List
作者是
发布于
在
LeetCode.
题目描述：
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third ...
[LeetCode]Lowest Common Ancestor of a Binary Tree
作者是
发布于
在
LeetCode.
题目描述：
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the ...