LeetCode题解（七）0600-0699，大厂经典高频面试题体系化集合

最新推荐文章于 2024-09-01 11:38:54 发布

努力马斯克

最新推荐文章于 2024-09-01 11:38:54 发布

阅读量933

点赞数 18

分类专栏： Android程序员文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/m0_60452293/article/details/136786071

版权

Android程序员专栏收录该内容

12 篇文章 0 订阅

订阅专栏

| 1 | A | m | 2500 |

| 2 | B | f | 1500 |

| 3 | C | m | 5500 |

| 4 | D | f | 500 |

After running your update statement, the above salary table should have the following rows:

| id | name | sex | salary |

| — | — | — | — |

| 1 | A | f | 2500 |

| 2 | B | m | 1500 |

| 3 | C | f | 5500 |

| 4 | D | m | 500 |

[Answer]

Runtime: 151 ms, faster than 61.29% of MySQL online submissions for Swap Salary.

Memory Usage: N/A

Write your MySQL query statement below

UPDATE salary SET sex = IF(sex = ‘f’, ‘m’, ‘f’)

657. Robot Return to Origin

[Description]

There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves.

The move sequence is represented by a string, and the character moves[i] represents its ith move. Valid moves are R (right), L (left), U (up), and D (down). If the robot returns to the origin after it finishes all of its moves, return true. Otherwise, return false.

Note: The way that the robot is “facing” is irrelevant. “R” will always make the robot move to the right once, “L” will always make it move left, etc. Also, assume that the magnitude of the robot’s movement is the same for each move.

Example 1:

Input: “UD”

Output: true

Explanation: The robot moves up once, and then down once. All moves have the same magnitude, so it ended up at the origin where it started. Therefore, we return true.

Example 2:

Input: “LL”

Output: false

Explanation: The robot moves left twice. It ends up two “moves” to the left of the origin. We return false because it is not at the origin at the end of its moves.

[Answer]

Runtime: 5 ms, faster than 94.72% of Java online submissions for Robot Return to Origin.

Memory Usage: 36.8 MB, less than 99.80% of Java online submissions for Robot Return to Origin.

class Solution {

public boolean judgeCircle(String moves) {

if (moves == null || moves.trim().length() == 0)

return true;

int x = 0, y = 0;

for (char c : moves.toCharArray()) {

switch © {

case ‘L’:

x–;