归档 2016年10月

题目描述：

LeetCode 439. Ternary Expression Parser

Given a string representing arbitrarily nested ternary expressions, calculate the result of the expression. You can always assume that the given expression is valid and only consists of digits 0-9, ?, :, T and F (T ...

题目描述：

LeetCode 438. Find All Anagrams in a String

Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.

Strings consists of lowercase English letters only and the length of ...

题目描述：

LeetCode 437. Path Sum III

You are given a binary tree in which each node contains an integer value.

Find the number of paths that sum to a given value.

The path does not need to start or end ...

题目描述：

LeetCode 420. Strong Password Checker

A password is considered strong if below conditions are all met:

1. It has at least 6 characters and at most 20 characters.
2. It must contain at least one lowercase letter, at least one uppercase ...

题目描述：

LeetCode 433. Minimum Genetic Mutation

A gene string can be represented by an 8-character long string, with choices from "A","C","G","T". 

Suppose we need to investigate about a mutation (mutation from "start" to "end"), where ONE ...