likesky3
- 浏览: 130685 次
-
最新评论
-
likesky3：
看了数据结构书得知并不是迭代和递归的区别，yb君的写法的效果是 ...
Leetcode - Graph Valid Tree -
likesky3：
迭代和递归的区别吧~
Leetcode - Graph Valid Tree -
qb_2008：
还有一种find写法：int find(int p) { i ...
Leetcode - Graph Valid Tree -
qb_2008：
要看懂这些技巧的代码确实比较困难。我是这么看懂的：1. 明白这 ...
Leetcode - Single Num II -
qb_2008：
public int singleNumber2(int[] ...
Leetcode - Single Num II
文章列表
Reverse a singly linked list.
// method 1: 逐个节点逆转
public ListNode reverseList1(ListNode head) {
if (head == null || head.next == null)
return head;
ListNode prev = head;
ListNode curr = prev.next;
prev.next = null; // miss this line w ...
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
Below is one possible representation of s1 = "great":
great
/ \
gr eat
/ \ / \
g r e at
/ \
...
Implement regular expression matching with support for '.' and '*'.
'.' Matches any single character.
'*' Matches zero or more of the preceding element.
The matching should cover the entire input string (not partial).
The function prototype should be:
bool isMatch(const char *s, const char *p)
Som ...
Given a string S and a string T, count the number of distinct subsequences of T in S.
A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, " ...
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most k transactions.
Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
[bala ...
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transactions.
Note:You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
...
The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially positioned in the top-left room and must fight his way through the dungeon to rescue the princess.
The ...
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
For "(()", the longest valid parentheses substring is "()", which has length = 2.
Another example is ")()())", where the longest valid ...
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.
For example,Given n = 3, your program should return all 5 unique BST's shown below.
1 3 3 2 1
\ / / / \ \
3 2 1 1 3 2
/ ...
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle
[
[2],
[3,4],
[6,5,7],
[4,1,8,3]
]
The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).
...
Given a string s and a dictionary of words dict, determine if s can be segmented into a sequence of one or more dictionary words.
But notice that each word in the dictionary can be used at most once.
For example:
the dictionary is {"leet", "co" "de" "code& ...
A message containing letters from A-Z is being encoded to numbers using the following mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26
Given an encoded message containing digits, determine the total number of ways to decode it.
For example,Given encoded message "12", it could be d ...
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,2,1] has the largest sum = 6.
public class Solution {
// dp[i] = max(A[i], dp[i - 1] + A[i])
publ ...
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
[分析] 倒推思路，从后往前推，要求走到最后一个格子的minPath, 若知道所有可能的倒数第二个格子的minPath,取其小者加上最后一格的值即可，题中之前一 ...
Follow up for "Unique Paths":
Now consider if some obstacles are added to the grids. How many unique paths would there be?
An obstacle and empty space is marked as 1 and 0 respectively in the grid.
For example,
There is one obstacle in the middle of a 3x3 grid as illustrated below.
[ ...