Schwifty - 博客园

2020年2月5日

摘要： There is a brick wall in front of you. The wall is rectangular and has several rows of bricks. The bricks have the same height but different width. Yo 阅读全文

posted @ 2020-02-05 09:11 Schwifty 阅读(188) 评论(0) 推荐(0)

553. Optimal Division

摘要： Given a list of positive integers, the adjacent integers will perform the float division. For example, [2,3,4] -> 2 / 3 / 4. However, you can add any 阅读全文

posted @ 2020-02-05 08:49 Schwifty 阅读(120) 评论(0) 推荐(0)

551. Student Attendance Record I

摘要： You are given a string representing an attendance record for a student. The record only contains the following three characters: 'A' : Absent. 'L' : L 阅读全文

posted @ 2020-02-05 07:36 Schwifty 阅读(124) 评论(0) 推荐(0)

2020年2月4日

589. N-ary Tree Preorder Traversal

摘要： Given an n-ary tree, return the preorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order traversal, 阅读全文

posted @ 2020-02-04 11:03 Schwifty 阅读(124) 评论(0) 推荐(0)

336. Palindrome Pairs

摘要： Given a list of unique words, find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + 阅读全文

posted @ 2020-02-04 08:22 Schwifty 阅读(121) 评论(0) 推荐(0)

349. Intersection of Two Arrays

摘要： Given two arrays, write a function to compute their intersection. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2] Example 2: Input: num 阅读全文

posted @ 2020-02-04 05:43 Schwifty 阅读(92) 评论(0) 推荐(0)

2020年2月3日

1342. Reduce Array Size to The Half

摘要： Given an array arr. You can choose a set of integers and remove all the occurrences of these integers in the array. Return the minimum size of the set 阅读全文

posted @ 2020-02-03 08:26 Schwifty 阅读(331) 评论(0) 推荐(0)

1341. The K Weakest Rows in a Matrix

摘要： Given a m * n matrix mat of ones (representing soldiers) and zeros (representing civilians), return the indexes of the k weakest rows in the matrix or 阅读全文

posted @ 2020-02-03 06:10 Schwifty 阅读(326) 评论(0) 推荐(0)

2020年1月31日

1046. Last Stone Weight

摘要： We have a collection of rocks, each rock has a positive integer weight. Each turn, we choose the two heaviest rocks and smash them together. Suppose t 阅读全文

posted @ 2020-01-31 12:43 Schwifty 阅读(140) 评论(0) 推荐(0)

1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance

摘要： There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and weighted edge b 阅读全文

posted @ 2020-01-31 12:02 Schwifty 阅读(267) 评论(0) 推荐(0)

热带雨林

公告