Skip to content
Gerry's Blog

Gerry's Blog

Gerry的博客

Category: LeetCode

Posted on October 18, 2020

LeetCode 1351. Count Negative Numbers in a Sorted Matrix

Given a m * n matrix grid which is sorted in non-increasing order both row-wise and column-wise.

Return the number of negative numbers in grid.[……]

Read more

Posted on October 18, 2020

LeetCode 1464. Maximum Product of Two Elements in an Array

Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1).[……]

Read more

Posted on October 18, 2020

LeetCode 980. Unique Paths III

On a 2-dimensional grid, there are 4 types of squares:

1 represents the starting square. There is exactly one starting square.
2 represents the e[……]

Read more

Posted on October 17, 2020

LeetCode 1450. Number of Students Doing Homework at a Given Time

Given two integer arrays startTime and endTime and given an integer queryTime.

The ith student started doing their homework at the time startTime[i[……]

Read more

Posted on October 17, 2020

LeetCode 1486. XOR Operation in an Array

Given an integer n and an integer start.

Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length.

Return the bitwise X[……]

Read more

Posted on October 17, 2020

LeetCode 1389. Create Target Array in the Given Order

Given two arrays of integers nums and index. Your task is to create target array under the following rules:

Initially target array is empty.
From[……]

Read more

Posted on October 17, 2020

LeetCode 1281. Subtract the Product and Sum of Digits of an Integer

Given an integer number n, return the difference between the product of its digits and the sum of its digits.

Example 1:

Input: n = 234
Outp[……]

Read more

Posted on October 17, 2020

LeetCode 1313. Decompress Run-Length Encoded List

We are given a list nums of integers representing a list compressed with run-length encoding.

Consider each adjacent pair of elements [freq, val] =[……]

Read more

Posted on October 17, 2020

LeetCode 1365. How Many Numbers Are Smaller Than the Current Number

Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the num[……]

Read more

Posted on October 17, 2020

LeetCode 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree

Given two binary trees original and cloned and given a reference to a node target in the original tree.

The cloned tree is a copy of the original t[……]

Read more

Posts navigation

Page 1 Page 2 … Page 38 Next page

Recent Posts

  • LeetCode 1351. Count Negative Numbers in a Sorted Matrix
  • LeetCode 1464. Maximum Product of Two Elements in an Array
  • LeetCode 980. Unique Paths III
  • LeetCode 1450. Number of Students Doing Homework at a Given Time
  • LeetCode 1486. XOR Operation in an Array

Recent Comments

  • Marjory Pagett on LeetCode 41. First Missing Positive
  • Graig Besser on LeetCode 41. First Missing Positive
  • Anette Larue on LeetCode 1302. Deepest Leaves Sum
  • xxx xxx on LeetCode 901. Online Stock Span
  • Quincy Schild on LeetCode 41. First Missing Positive

Archives

  • October 2020
  • September 2020
  • May 2020
  • March 2020
  • February 2020
  • January 2020
  • December 2019
  • November 2019
  • October 2019
  • September 2019
  • August 2019
  • July 2019
  • June 2019
  • May 2019
  • April 2019
  • March 2019
  • February 2019
  • January 2019
  • December 2018
  • November 2018

Categories

  • Google Code Jam
  • JAVA
  • LeetCode
  • MapReduce
  • MongoDB
  • Spark
  • SpringCloud
  • Uncategorized

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org

Ads

Proudly powered by WordPress