Eatswap
/
leetcode-daily
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

add: description

This commit is contained in:
Lam Haoyin 2022-02-26 00:51:20 +08:00
parent f8be64124f
commit 04c1459e29
No known key found for this signature in database
GPG Key ID: 8C089CB1A2B7544F
2 changed files with 28 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
cpp/2202/220224-CN.cpp
View File

@ -1,6 +1,19 @@
#include <vector>
#include <iostream>
/**
* 1706. Where Will the Ball Fall
* You have a 2-D grid of size m x n representing a box, and you have n balls. The box is open on the top and bottom sides.
*
* Each cell in the box has a diagonal board spanning two corners of the cell that can redirect a ball to the right or to the left.
*
* A board that redirects the ball to the right spans the top-left corner to the bottom-right corner and is represented in the grid as 1.
* A board that redirects the ball to the left spans the top-right corner to the bottom-left corner and is represented in the grid as -1.
* We drop one ball at the top of each column of the box. Each ball can get stuck in the box or fall out of the bottom. A ball gets stuck if it hits a "V" shaped pattern between two boards or if a board redirects the ball into either wall of the box.
*
* Return an array answer of size n where answer[i] is the column that the ball falls out of at the bottom after dropping the ball from the ith column at the top, or -1 if the ball gets stuck in the box.
*/
class Solution {
public:
static std::vector<int> findBall(const std::vector<std::vector<int>>& grid) {

15
cpp/2202/220225.cpp
View File

@ -4,6 +4,21 @@
inline constexpr int sgn(int x) { return x ? (x > 0 ? 1 : -1) : 0; }
/**
* 165. Compare Version Numbers
* Given two version numbers, version1 and version2, compare them.
*
* Version numbers consist of one or more revisions joined by a dot '.'. Each revision consists of digits and may contain leading zeros. Every revision contains at least one character. Revisions are 0-indexed from left to right, with the leftmost revision being revision 0, the next revision being revision 1, and so on. For example 2.5.33 and 0.1 are valid version numbers.
*
* To compare version numbers, compare their revisions in left-to-right order. Revisions are compared using their integer value ignoring any leading zeros. This means that revisions 1 and 001 are considered equal. If a version number does not specify a revision at an index, then treat the revision as 0. For example, version 1.0 is less than version 1.1 because their revision 0s are the same, but their revision 1s are 0 and 1 respectively, and 0 < 1.
*
* Return the following:
*
* If version1 < version2, return -1.
* If version1 > version2, return 1.
* Otherwise, return 0.
*/
class Version {
private:
std::vector<int> revisions;