码迷,mamicode.com
首页 >  
搜索关键字:given n integers    ( 24278个结果
【leetcode】1509. Minimum Difference Between Largest and Smallest Value in Three Moves
题目如下: Given an array nums, you are allowed to choose one element of nums and change it by any value in one move. Return the minimum difference between ...
分类:其他好文   时间:2020-09-17 22:48:12    阅读次数:35
LeetCode | 0040. Combination Sum II组合总和 II【Python】
Problem LeetCode Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where t ...
分类:编程语言   时间:2020-09-17 20:29:16    阅读次数:30
758. Bold Words in String
package LeetCode_758 import java.util.* import kotlin.collections.HashSet /** * 758. Bold Words in String * (Prime) * Given a set of keywords words an ...
分类:其他好文   时间:2020-09-17 18:53:02    阅读次数:31
450. Delete Node in a BST - Medium
Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of th ...
分类:其他好文   时间:2020-09-15 21:24:11    阅读次数:42
LeetCode 632. Smallest Range Covering Elements from K Lists(632. 最小区间)
题目地址:632. 最小区间 You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k li ...
分类:其他好文   时间:2020-08-26 17:10:59    阅读次数:46
538. Convert BST to Greater Tree
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all ...
分类:其他好文   时间:2020-08-19 19:48:05    阅读次数:63
1038. Binary Search Tree to Greater Sum Tree
Given the root of a binary search tree with distinct values, modify it so that every node has a new value equal to the sum of the values of the origin ...
分类:其他好文   时间:2020-08-19 19:47:45    阅读次数:64
408. Valid Word Abbreviation
package LeetCode_408 /** * 408. Valid Word Abbreviation * (Prime) * Given a non-empty string s and an abbreviation abbr, return whether the string mat ...
分类:其他好文   时间:2020-08-17 17:30:35    阅读次数:64
Leetcode.76 Minimum Window Substring (Java)
Leetcode.76 Minimum Window Substring Given a string S and a string T, find the minimum window in S which will contain all the characters in T in compl ...
分类:编程语言   时间:2020-08-11 15:56:40    阅读次数:64
582. Kill Process
package LeetCode_582 import java.util.* import kotlin.collections.ArrayList import kotlin.collections.HashMap /** * 582.Kill Process * (Prime) *Given ...
分类:其他好文   时间:2020-08-10 09:25:07    阅读次数:54
24278条   上一页 1 ... 12 13 14 15 16 ... 2428 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!