给定一个字符串，你需要反转字符串中每个单词的字符顺序，同时仍保留空格和单词的初始顺序。示例：输入："Let's take LeetCode contest"输出："s'teL ekat edoCteeL tsetnoc"提示：在字符串中，每个单词由单个空格分隔，并且字符串中不会有任何额外的空格。来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/reverse-words-in-a-string-iii著作权归领扣网络所有..
找出数组中重复的数字。在一个长度为 n 的数组 nums 里的
给你一个整数n，请你返回任意一个由n个各不相同的整数组成的数组，并且这n个数相加和为0。示例 1：输入：n = 5输出：[-7,-1,1,3,4]解释：这些数组也是正确的 [-5,-1,1,2,3]，[-3,-1,2,-2,4]。示例 2：输入：n = 3输出：[-1,0,1]示例 3：输入：n = 1输出：[0]提...
给你root1和root2这两棵二叉搜索树。请你返回一个列表，其中包含两棵树中的所有整数并按升序排序。.示例 1：输入：root1 = [2,1,4], root2 = [1,0,3]输出：[0,1,1,2,3,4]示例 2：输入：root1 = [0,-10,10], root2 = [5,1,7,0,2]输出：[-10,0,0,1,2,5...
这里有一个非负整数数组arr，你最开始位于该数组的起始下标start处。当你位于下标i处时，你可以跳到i + arr[i]或者i - arr[i]。请你判断自己是否能够跳到对应元素值为 0 的任意下标处。注意，不管是什么情况下，你都无法跳到数组之外。示例 1：输入：arr = [4,2,3,0,3,1,2], start = 5输出：true解释：...
给定一个可包含重复数字的序列，返回所有不重复的
5278. Palindrome Partitioning IIIYou are given a strings containing lowerc
5277. Count Square Submatrices with All OnesGiven a m * n matrix of ones and zeros, return how many square submatrices have all ones.Example 1:Input: matrix =[[0,1,1,1],[1,1,1,1],[0...
感觉自己有点low，赶紧把那两道题做了吧
编写一个函数，输入是一个无符号整数，返回其二进制表达式中数字位数为 ‘1’的个数（也被称为汉明重量）。示例 1：输入：00000000000000000000000000001011输出：3解释：输入的二进制串 00000000000000000000000000001011中，共有三位为 '1'。示例 2：输入：0000000000000000000000001000...
1.leetcode报错：member access within null pointer of type 'struct ListNode'访问了空指针2.terminate called after throwing an instance of 'std::out_of_range'
ImplementstrStr().Return the index of the first occurrence of needle in haystack, or-1if needle is not part of haystack.Example 1:Input: haystack = "hello", needle = "ll"Output: 2Example...
Write a function that reverses a string. The input string is given as an array of characterschar[].Do not allocate extra space for another array, you must do this bymodifying the input arrayin-pl...
刚完成的时候还70多名。。。然后后面两道题再也没做上来。第一题class Solution {public: int minTimeToVisitAllPoints(vector<vector<int>>& points) { int sum=0; for(int i=1;i<points.s...
给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。百度百科中最近公共祖先的定义为：“对于有根树 T
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.Coul...
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I I ...
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())",...
5. Longest Palindromic SubstringGiven a strings, find the longest palindromic substring ins. You may assume that the maximum length ofsis 1000.Example 1:Input: "babad"Output: "bab"Note...
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are d
Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type o...
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Example:Input: 1->2->4, 1->3->4Output: 1-&...
Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as poss...
Roman numerals are represented by seven different symbols:I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D ...
Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.You need to find ...
5238.找出给定方程的正整数解显示英文描述我的提交返回竞赛用户通过次数745 用户尝试次数796 通过次数757 提交次数1221 题目难度Easy给出一个函数f(x, y)和一个目标结果z，请你计算方程f(x,y) == z所有可能的正整数数对x和y。给定函数是严格单调的，也就是说：f(x, y) < f(x + 1, y) f(...
Given a non-empty array of digitsrepresenting a non-negative integer, plus one to the integer.The digits are stored such that the most significant digit is at the head of the list, and each element...
Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string"".Example 1:Input: ["flower","flow","flight"]Output:...
On a plane there are n points with integer coordinates points[i] = [xi, yi]. Your task is to find the minimum time in seconds to visit all points.You can move according to the next rules:In one se...
Copyright © 2005-2025 51CTO.COM 版权所有 京ICP证060544号
