seyjs - 博客园

2019年11月12日

【leetcode】1253. Reconstruct a 2-Row Binary Matrix

摘要：题目如下： Given the following details of a matrix with n columns and 2 rows : The matrix is a binary matrix, which means each element in the matrix can be 阅读全文

posted @ 2019-11-12 13:19 seyjs 阅读(328) 评论(0) 推荐(0) 编辑

【leetcode】1252. Cells with Odd Values in a Matrix

摘要：题目如下： Given n and m which are the dimensions of a matrix initialized by zeros and given an array indices where indices[i] = [ri, ci]. For each pair of 阅读全文

posted @ 2019-11-12 11:01 seyjs 阅读(533) 评论(0) 推荐(0) 编辑

2019年11月4日

【leetcode】960. Delete Columns to Make Sorted III

摘要：题目如下： We are given an array A of N lowercase letter strings, all of the same length. Now, we may choose any set of deletion indices, and for each stri 阅读全文

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

【leetcode】1249. Minimum Remove to Make Valid Parentheses

摘要：题目如下： Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ( '(' or ')', in any po 阅读全文

posted @ 2019-11-04 10:24 seyjs 阅读(834) 评论(0) 推荐(0) 编辑

【leetcode】1248. Count Number of Nice Subarrays

摘要：题目如下： Given an array of integers nums and an integer k. A subarray is called nice if there are k odd numbers on it. Return the number of nice sub-arra 阅读全文

posted @ 2019-11-04 10:16 seyjs 阅读(549) 评论(0) 推荐(0) 编辑

【leetcode】1247. Minimum Swaps to Make Strings Equal

摘要：题目如下： You are given two strings s1 and s2 of equal length consisting of letters "x" and "y" only. Your task is to make these two strings equal to each 阅读全文

posted @ 2019-11-04 10:04 seyjs 阅读(526) 评论(0) 推荐(0) 编辑

2019年10月29日

【leetcode】1239. Maximum Length of a Concatenated String with Unique Characters

摘要：题目如下： Given an array of strings arr. String s is a concatenation of a sub-sequence of arr which have unique characters. Return the maximum possible le 阅读全文

posted @ 2019-10-29 14:28 seyjs 阅读(617) 评论(0) 推荐(0) 编辑

【leetcode】1237. Find Positive Integer Solution for a Given Equation

摘要：题目如下： Given a function f(x, y) and a value z, return all positive integer pairs x and y where f(x,y) == z. The function is constantly increasing, i.e. 阅读全文

posted @ 2019-10-29 14:21 seyjs 阅读(523) 评论(0) 推荐(0) 编辑

2019年10月28日

【leetcode】LCP 2. 分式化简

摘要：题目如下：有一个同学在学习分式。他需要将一个连分数化成最简分数，你能帮助他吗？连分数是形如上图的分式。在本题中，所有系数都是大于等于0的整数。输入的cont代表连分数的系数（cont[0]代表上图的a0，以此类推）。返回一个长度为2的数组[n, m]，使得连分数的值等于n / m，且n, m最阅读全文

posted @ 2019-10-28 22:19 seyjs 阅读(373) 评论(0) 推荐(0) 编辑

2019年10月25日

【leetcode】801. Minimum Swaps To Make Sequences Increasing

摘要：题目如下： We have two integer sequences A and B of the same non-zero length. We are allowed to swap elements A[i] and B[i]. Note that both elements are in 阅读全文

posted @ 2019-10-25 13:11 seyjs 阅读(274) 评论(0) 推荐(0) 编辑

公告