墨云黑

2020年7月3日

摘要： Spiral Matrix (M) 题目 Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. Example 1: Input: [ [ 1, 阅读全文

posted @ 2020-07-03 03:19 墨云黑阅读(144) 评论(0) 推荐(0) 编辑

0053. Maximum Subarray (E)

摘要： Maximum Subarray (E) 题目 Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and retur 阅读全文

posted @ 2020-07-03 01:12 墨云黑阅读(158) 评论(0) 推荐(0) 编辑

0107. Binary Tree Level Order Traversal II (E)

摘要： Binary Tree Level Order Traversal II (E) 题目 Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to ri 阅读全文

posted @ 2020-07-03 00:52 墨云黑阅读(143) 评论(0) 推荐(0) 编辑

2020年7月2日

0052. N-Queens II (H)

摘要： N-Queens II (H) 题目 The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an int 阅读全文

posted @ 2020-07-02 08:45 墨云黑阅读(231) 评论(0) 推荐(0) 编辑

0051. N-Queens (H)

摘要： N-Queens (H) 题目 The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an intege 阅读全文

posted @ 2020-07-02 04:54 墨云黑阅读(184) 评论(0) 推荐(0) 编辑

0441. Arranging Coins (E)

摘要： Arranging Coins (E) 题目 You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins. Given n 阅读全文

posted @ 2020-07-02 03:52 墨云黑阅读(184) 评论(0) 推荐(0) 编辑

2020年7月1日

0328. Odd Even Linked List (M)

摘要： Odd Even Linked List (M) 题目 Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about 阅读全文

posted @ 2020-07-01 07:04 墨云黑阅读(148) 评论(0) 推荐(0) 编辑

0338. Counting Bits (M)

摘要： Counting Bits (M) 题目 Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary 阅读全文

posted @ 2020-07-01 06:46 墨云黑阅读(177) 评论(0) 推荐(0) 编辑

0347. Top K Frequent Elements (M)

摘要： Top K Frequent Elements (M) 题目 Given a non-empty array of integers, return the *k* most frequent elements. Example 1: Input: nums = [1,1,1,2,2,3], k = 阅读全文

posted @ 2020-07-01 06:01 墨云黑阅读(144) 评论(0) 推荐(0) 编辑

0050. Pow(x, n) (M)

摘要： Pow(x, n) (M) 题目 mplement pow(x, n), which calculates x raised to the power n (\(x^n\)). Example 1: Input: 2.00000, 10 Output: 1024.00000 Example 2: I 阅读全文

posted @ 2020-07-01 03:08 墨云黑阅读(208) 评论(0) 推荐(0) 编辑

公告