上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 63 下一页
摘要: There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and weighted edge b 阅读全文
posted @ 2023-11-14 01:35 CNoodle 阅读(64) 评论(0) 推荐(0)
摘要: You are given four integers sx, sy, fx, fy, and a non-negative integer t. In an infinite 2D grid, you start at the cell (sx, sy). Each second, you mus 阅读全文
posted @ 2023-11-09 01:24 CNoodle 阅读(23) 评论(0) 推荐(0)
摘要: You are given a binary string s consisting only of zeroes and ones. A substring of s is considered balanced if all zeroes are before ones and the numb 阅读全文
posted @ 2023-11-08 02:17 CNoodle 阅读(40) 评论(0) 推荐(0)
摘要: Given an integer array arr of distinct integers and an integer k. A game will be played between the first two elements of the array (i.e. arr[0] and a 阅读全文
posted @ 2023-11-05 13:48 CNoodle 阅读(61) 评论(0) 推荐(0)
摘要: You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers. You should rearrange the 阅读全文
posted @ 2023-11-04 13:13 CNoodle 阅读(58) 评论(0) 推荐(0)
摘要: Given the root of a binary tree, return the number of nodes where the value of the node is equal to the average of the values in its subtree. Note: Th 阅读全文
posted @ 2023-11-03 07:02 CNoodle 阅读(44) 评论(0) 推荐(0)
摘要: Given a 0-indexed integer array nums, find a 0-indexed integer array answer where: answer.length == nums.length. answer[i] = |leftSum[i] - rightSum[i] 阅读全文
posted @ 2023-11-01 03:58 CNoodle 阅读(28) 评论(0) 推荐(0)
摘要: (This problem is an interactive problem.) Each ship is located at an integer point on the sea represented by a cartesian plane, and each integer point 阅读全文
posted @ 2023-10-31 03:52 CNoodle 阅读(38) 评论(0) 推荐(0)
摘要: You are given an integer array gifts denoting the number of gifts in various piles. Every second, you do the following: Choose the pile with the maxim 阅读全文
posted @ 2023-10-28 06:05 CNoodle 阅读(41) 评论(0) 推荐(0)
摘要: A transaction is possibly invalid if: the amount exceeds $1000, or; if it occurs within (and including) 60 minutes of another transaction with the sam 阅读全文
posted @ 2023-10-26 05:31 CNoodle 阅读(43) 评论(0) 推荐(0)
摘要: Given an array nums of distinct positive integers, return the number of tuples (a, b, c, d) such that a * b = c * d where a, b, c, and d are elements 阅读全文
posted @ 2023-10-21 07:12 CNoodle 阅读(106) 评论(0) 推荐(0)
摘要: Given four integers length, width, height, and mass, representing the dimensions and mass of a box, respectively, return a string representing the cat 阅读全文
posted @ 2023-10-20 10:56 CNoodle 阅读(26) 评论(0) 推荐(0)
摘要: You are given a 0-indexed integer array nums and an integer k. You have a starting score of 0. In one operation: choose an index i such that 0 <= i < 阅读全文
posted @ 2023-10-18 09:48 CNoodle 阅读(54) 评论(0) 推荐(0)
摘要: Given a positive integer num, split it into two non-negative integers num1 and num2 such that: The concatenation of num1 and num2 is a permutation of  阅读全文
posted @ 2023-10-09 14:16 CNoodle 阅读(43) 评论(0) 推荐(0)
摘要: There are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every second, the person holdin 阅读全文
posted @ 2023-09-26 13:45 CNoodle 阅读(54) 评论(0) 推荐(0)
摘要: On a 0-indexed 8 x 8 chessboard, there can be multiple black queens ad one white king. You are given a 2D integer array queens where queens[i] = [xQue 阅读全文
posted @ 2023-09-16 05:13 CNoodle 阅读(21) 评论(0) 推荐(0)
摘要: There is a knight on an n x n chessboard. In a valid configuration, the knight starts at the top-left cell of the board and visits every cell on the b 阅读全文
posted @ 2023-09-16 02:10 CNoodle 阅读(31) 评论(0) 推荐(0)
摘要: You are given two integers n and k and two integer arrays speed and efficiency both of length n. There are n engineers numbered from 1 to n. speed[i]  阅读全文
posted @ 2023-09-08 05:58 CNoodle 阅读(39) 评论(0) 推荐(0)
摘要: You are given an integer array ranks representing the ranks of some mechanics. ranksi is the rank of the ith mechanic. A mechanic with a rank r can re 阅读全文
posted @ 2023-09-07 06:35 CNoodle 阅读(90) 评论(2) 推荐(0)
摘要: You are given an integer array pref of size n. Find and return the array arr of size n that satisfies: pref[i] = arr[0] ^ arr[1] ^ ... ^ arr[i]. Note 阅读全文
posted @ 2023-09-05 04:13 CNoodle 阅读(72) 评论(0) 推荐(0)
上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 63 下一页