LeetCode

題目

Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only one right child.

題目

You are keeping score for a baseball game with strange rules. The game consists of several rounds, where the scores of past rounds may affect future rounds’ scores.

題目

You are given an array of integers stones where stones[i] is the weight of the ith stone.

題目

Given a string s, return true if the s can be palindrome after deleting at most one character from it.

題目

Write a function that reverses a string. The input string is given as an array of characters s.

… Read More »LeetCode: 74-Search a 2D Matrix 解題紀錄

題目

There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values).

題目

You are given an m x n binary matrix mat of 1‘s (representing soldiers) and 0‘s (representing civilians). The soldiers are positioned in front of the civilians. That is, all the 1‘s will appear to the left of all the 0‘s in each row.

題目

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.