LeetCode题解（七）0600-0699

• TreeNode(int x) { val = x; }
  

• }

*/

class Solution {

public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {

if (t1 == null && t2 == null)

return null;

if (t1 == null)

return t2;

if (t2 == null)

return t1;

t1.val = t1.val + t2.val;

t1.left = mergeTrees(t1.left, t2.left);

t1.right = mergeTrees(t1.right, t2.right);

return t1;

}

}

620. Not Boring Movies

Runtime: 124 ms, faster than 74.64% of MySQL online submissions for Not Boring Movies.

Memory Usage: N/A

Write your MySQL query statement below

select * from cinema where id%2=1 and description != ‘boring’ order by rating desc;

627. Swap Salary

[Description]

SQL Schema

Given a table salary, such as the one below, that has m=male and f=female values. Swap all f and m values (i.e., change all f values to m and vice versa) with a single update statement and no intermediate temp table.

Note that you must write a single update statement, DO NOT write any select statement for this problem.

Example:

| id | name | sex | salary |

| — | — | — | — |

| 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–;

break;

case ‘R’:

x++;

break;

case ‘U’:

y++;

break;

case ‘D’:

y–;

break;

}

}

return x == 0 && y == 0;

}

}

665. Non-decreasing Array

Runtime: 1 ms, faster than 99.42% of Java online submissions for Non-decreasing Array.

Memory Usage: 46.6 MB, less than 9.52% of Java online submissions for Non-decreasing Array.

class Solution {

public static boolean checkPossibility(int[] nums) {

for(int i = 0; i < nums.length - 1; i++){

//first occurance

if(nums[i] > nums[i+1]){

for(int j = i + 1; j < nums.length - 1; j++){

学习分享

①「Android面试真题解析大全」PDF完整高清版+②「Android面试知识体系」学习思维导图压缩包

《Android学习笔记总结+移动架构视频+大厂面试真题+项目实战源码》，点击传送门，即可获取！
F完整高清版+②「Android面试知识体系」学习思维导图压缩包**

[外链图片转存中…(img-GMmknAED-1715328762158)]

[外链图片转存中…(img-bUfOa4Qj-1715328762162)]

[外链图片转存中…(img-B6EjZ3nI-1715328762164)]
《Android学习笔记总结+移动架构视频+大厂面试真题+项目实战源码》，点击传送门，即可获取！