Veritas_des_Liberty

2019年3月13日

689. Maximum Sum of 3 Non-Overlapping Subarrays

摘要： In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum. Each subarray will be of size k, and we want to max 阅读全文

posted @ 2019-03-13 18:17 Veritas_des_Liberty 阅读(220) 评论(0) 推荐(0)

730. Count Different Palindromic Subsequences

摘要： Given a string S, find the number of different non-empty palindromic subsequences in S, and return that number modulo 10^9 + 7. A subsequence of a str 阅读全文

posted @ 2019-03-13 17:06 Veritas_des_Liberty 阅读(276) 评论(0) 推荐(0)

688. Knight Probability in Chessboard

摘要： On an NxN chessboard, a knight starts at the r-th row and c-th column and attempts to make exactly K moves. The rows and columns are 0 indexed, so the 阅读全文

posted @ 2019-03-13 13:25 Veritas_des_Liberty 阅读(307) 评论(0) 推荐(0)

673. Number of Longest Increasing Subsequence

摘要： Given an unsorted array of integers, find the number of longest increasing subsequence. Example 1: Example 2: Note: Length of the given array will be 阅读全文

posted @ 2019-03-13 12:44 Veritas_des_Liberty 阅读(181) 评论(0) 推荐(0)

2019年3月12日

664. Strange Printer

摘要： There is a strange printer with the following two special requirements: The printer can only print a sequence of the same character each time. At each 阅读全文

posted @ 2019-03-12 16:16 Veritas_des_Liberty 阅读(242) 评论(0) 推荐(0)

650. 2 Keys Keyboard

摘要： Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step: Given a number n. You have to 阅读全文

posted @ 2019-03-12 15:30 Veritas_des_Liberty 阅读(239) 评论(0) 推荐(0)

Java异常处理

摘要：这是课程里给的代码，自己看着讲义在里面加了些注释。阅读全文

posted @ 2019-03-12 11:37 Veritas_des_Liberty 阅读(241) 评论(0) 推荐(0)

2019年3月11日

647. Palindromic Substrings

摘要： Given a string, your task is to count how many palindromic substrings in this string. The substrings with different start indexes or end indexes are c 阅读全文

posted @ 2019-03-11 16:38 Veritas_des_Liberty 阅读(197) 评论(0) 推荐(0)

646. Maximum Length of Pair Chain

摘要： You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow an 阅读全文

posted @ 2019-03-11 16:02 Veritas_des_Liberty 阅读(184) 评论(0) 推荐(0)

2019年3月10日

639. Decode Ways II

摘要： A message containing letters from A-Z is being encoded to numbers using the following mapping way: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Beyond that, now th 阅读全文

posted @ 2019-03-10 22:27 Veritas_des_Liberty 阅读(299) 评论(0) 推荐(0)

Veritas des Liberty

公告