Veritas_des_Liberty

2019年4月15日

摘要： Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can f 阅读全文

posted @ 2019-04-15 19:14 Veritas_des_Liberty 阅读(166) 评论(0) 推荐(0) 编辑

KMP Demo

摘要： The key of Kmp is to build a look up table that records the match result of prefix and postfix. Value in the table means the max len of matching subst 阅读全文

posted @ 2019-04-15 17:40 Veritas_des_Liberty 阅读(322) 评论(0) 推荐(0) 编辑

125. Valid Palindrome

摘要： Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. Note: For the purpose of this problem, w 阅读全文

posted @ 2019-04-15 14:40 Veritas_des_Liberty 阅读(156) 评论(0) 推荐(0) 编辑

2019年4月14日

Weekly Contest 132

摘要： 1025. Divisor Game Alice and Bob take turns playing a game, with Alice starting first. Initially, there is a number N on the chalkboard. On each playe 阅读全文

posted @ 2019-04-14 17:50 Veritas_des_Liberty 阅读(312) 评论(0) 推荐(0) 编辑

2019年4月13日

1007. Minimum Domino Rotations For Equal Row

摘要： In a row of dominoes, A[i] and B[i] represent the top and bottom halves of the i-th domino. (A domino is a tile with two numbers from 1 to 6 - one on 阅读全文

posted @ 2019-04-13 12:27 Veritas_des_Liberty 阅读(446) 评论(0) 推荐(0) 编辑

1002. Find Common Characters

摘要： Given an array A of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list (including d 阅读全文

posted @ 2019-04-13 11:27 Veritas_des_Liberty 阅读(286) 评论(0) 推荐(0) 编辑

2019年4月12日

974. Subarray Sums Divisible by K

摘要： Given an array A of integers, return the number of (contiguous, non-empty) subarrays that have a sum divisible by K. Example 1: Note: Approach #1: Has 阅读全文

posted @ 2019-04-12 22:00 Veritas_des_Liberty 阅读(439) 评论(0) 推荐(0) 编辑

926. Flip String to Monotone Increasing

摘要： A string of '0's and '1's is monotone increasing if it consists of some number of '0's (possibly 0), followed by some number of '1's (also possibly 0. 阅读全文

posted @ 2019-04-12 21:19 Veritas_des_Liberty 阅读(300) 评论(0) 推荐(0) 编辑

2019年4月11日

918. Maximum Sum Circular Subarray

摘要： Given a circular array C of integers represented by A, find the maximum possible sum of a non-empty subarray of C. Here, a circular array means the en 阅读全文

posted @ 2019-04-11 22:33 Veritas_des_Liberty 阅读(254) 评论(0) 推荐(0) 编辑

914. X of a Kind in a Deck of Cards

摘要： In a deck of cards, each card has an integer written on it. Return true if and only if you can choose X >= 2 such that it is possible to split the ent 阅读全文

posted @ 2019-04-11 21:29 Veritas_des_Liberty 阅读(337) 评论(0) 推荐(0) 编辑

Veritas des Liberty

公告