jxr041100

2017年11月24日

摘要： In combinatorial mathematics, a derangement is a permutation of the elements of a set, such that no element appears in its original position. There's 阅读全文

posted @ 2017-11-24 09:48 jxr041100 阅读(215) 评论(0) 推荐(0)

625. Minimum Factorization

摘要： Given a positive integer a, find the smallest positive integer b whose multiplication of each digit equals to a. If there is no answer or the answer i 阅读全文

posted @ 2017-11-24 09:30 jxr041100 阅读(212) 评论(0) 推荐(0)

2017年11月23日

683. K Empty Slots

摘要： here is a garden with N slots. In each slot, there is a flower. The N flowers will bloom one by one in N days. In each day, there will be exactly one 阅读全文

posted @ 2017-11-23 17:06 jxr041100 阅读(326) 评论(0) 推荐(0)

727. Minimum Window Subsequence

摘要： Given strings S and T, find the minimum (contiguous) substring W of S, so that T is a subsequence of W. If there is no such window in S that covers al 阅读全文

posted @ 2017-11-23 17:04 jxr041100 阅读(361) 评论(0) 推荐(0)

616. Add Bold Tag in String

摘要： Given a string s and a list of strings dict, you need to add a closed pair of bold tag <b> and </b> to wrap the substrings in s that exist in dict. If 阅读全文

posted @ 2017-11-23 17:02 jxr041100 阅读(210) 评论(0) 推荐(0)

588. Design In-Memory File System

摘要： Design an in-memory file system to simulate the following functions: ls: Given a path in string format. If it is a file path, return a list that only 阅读全文

posted @ 2017-11-23 17:01 jxr041100 阅读(230) 评论(0) 推荐(0)

568. Maximum Vacation Days

摘要： LeetCode wants to give one of its best employees the option to travel among N cities to collect algorithm problems. But all work and no play makes Jac 阅读全文

posted @ 2017-11-23 16:59 jxr041100 阅读(117) 评论(0) 推荐(0)

555. Split Concatenated Strings

摘要： Given a list of strings, you could concatenate these strings together into a loop, where for each string you could choose to reverse it or not. Among 阅读全文

posted @ 2017-11-23 16:57 jxr041100 阅读(206) 评论(0) 推荐(0)

549. Binary Tree Longest Consecutive Sequence II

摘要： Given a binary tree, you need to find the length of Longest Consecutive Path in Binary Tree. Especially, this path can be either increasing or decreas 阅读全文

posted @ 2017-11-23 16:56 jxr041100 阅读(123) 评论(0) 推荐(0)

548. Split Array with Equal Sum

摘要： Given an array with n integers, you need to find if there are triplets (i, j, k) which satisfies following conditions: where we define that subarray ( 阅读全文

posted @ 2017-11-23 16:54 jxr041100 阅读(166) 评论(0) 推荐(0)

公告