leetcode 441--Arranging Coins

最新推荐文章于 2019-08-01 20:26:52 发布

原创最新推荐文章于 2019-08-01 20:26:52 发布 · 167 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

Leetcode 专栏收录该内容

84 篇文章

订阅专栏

本文探讨了如何使用高效算法解决硬币阶梯问题。通过寻找能够形成完整阶梯行的最大数量，提出了两种解决方案：一种是常规方法，另一种是利用高斯算法进行优化。优化后的算法大大减少了计算时间。

难度： easy

You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.

Given n, find the total number of full staircase rows that can be formed.

n is a non-negative integer and fits within the range of a 32-bit signed integer

思路：此题有两种解法，一种是按照传统思路做，耗时很长，容易超时。还有一种是按照高斯算法，1+2+3+4+....+x<=n 即 x(x+1)/2 <=n,按照一元二次解法求出正数x

第二种方法：简单至极

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

手掌大的苍穹

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

专栏目录

(LeetCode)Arranging Coins --- 硬币排列

杨鑫newlife的专栏

11-15

790

(LeetCode)Arranging Coins --- 硬币排列

leetcode: 441.排列硬币

uncle_ll的博客

10-10

302

题目来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/arranging-coins 你总共有 n 枚硬币，并计划将它们按阶梯状排列。对于一个由 k 行组成的阶梯，其第 i 行必须正好有 i 枚硬币。阶梯的最后一行可能是不完整的。给你一个数字 n ，计算并返回可形成完整阶梯行的总行数。示例 1：输入：n = 5 输出：2 解释：因为第三行不完整，所以返回 2 。示例 2：输入：n = 8 输出：3 解释：因为第四行不完整，所以返

参与评论您还未登录，请先登录后发表或查看评论

LeetCode-441. Arranging Coins

zy2317878的博客

02-12

235

Description Example 1 Example 2 Solution 1(C++) class Solution { public: int arrangeCoins(int n) { int digit=1; int count=0; while(n >= 0){ n -= ...

leetcode-441-Arranging Coins

weixin_34124939的博客

04-22

题目描述： You have a total ofncoins that you want to form in a staircase shape, where everyk-th row must have exactlykcoins. Givenn, find the total number offullstaircase rows that can be formed...

leetcode-441. Arranging Coins

mcf171的专栏

01-30

288

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发优快云，mcf171专栏。博客链接：mcf171的博客 —————————————————————————————— You have a total of n coins that y

LeetCode--Arranging Coins

qq_27318693的博客

08-01

154

441.Arranging Coins You have a total ofncoins that you want to form in a staircase shape, where everyk-th row must have exactlykcoins. Givenn, find the total number offullstaircase rows tha...

LeetCode -- Arranging Coins

我的英文站点：https://iorilan.medium.com/

02-19

950

LeetCode -- Arranging Coins

LeetCode笔记：441. Arranging Coins

Minecraft

11-02

3075

n个硬币能摆出多少层的完整楼梯

LeetCode #441 - Arranging Coins

LawFile的博客

08-04

129

题目描述： You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins. Given n, find the total number of full staircase rows that can be formed...

Leetcode 441 - Arranging Coins（Math）

博客已迁移至：lzed.github.io

02-11

206

题意给出一个n，然后我们去1,2,3…的使用n。问做多能多少次（如果最后一次不够的话就不计入结果）思路算法1满足的条件是：k(k+1)2≤n\frac{k(k+1)}{2} \leq n的最大k。本来想二分一下k。然后判断。但是，从上面那个式子我们可以知道：k(k+1)≤2nk(k + 1) \leq 2n。即我们k≤2n−−√≤k+1k \leq \sqrt{2n} \leq k+1。于是我们对2

[leetcode]-441. Arranging Coins（C语言）

shen_zhu的博客

08-25

221

You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins. Given n, find the total number of full staircase rows that can be formed. n is...

LeetCode 441. 排列硬币（数学解方程）

12-21

1. 题目你总共有 n 枚硬币，你需要将它们摆成一个阶梯形状，第 k 行就必须正好有 k...来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/arranging-coins 著作权归领扣网络所有。商业转载请联系官方授权

LeetCode最全代码

04-09

# [LeetCode](https://leetcode.com/problemset/algorithms/) ![Language](https://img.shields.io/badge/language-Python%20%2F%20C++%2011-orange.svg) [![License]...

leetcode66-Plus One

fawnzou2017的博客

11-21

458

题目：难度（Easy） Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leading zero, except the number 0 it

Leetcode 560[medium]. Subarray Sum Equals K

fawnzou2017的博客

12-14

342

难度：medium Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Input:nums = [1,1,1], k = 2 Output: 2 No

leetcode383[easy]--- Ransom Note

fawnzou2017的博客

12-04

305

难度：easy Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the mag

leetcode 605[easy]---Can Place Flowers

fawnzou2017的博客

12-22

290

难度：easy Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both

leetcode121- Best Time to Buy and Sell Stock

fawnzou2017的博客

11-25

285

难度： easy Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one shar

leetcode 735[medium]---Asteroid Collision

fawnzou2017的博客

12-22

274

难度：medium We are given an array asteroids of integers representing asteroids in a row. For each asteroid, the absolute value represents its size, and the sign represents its direction (posit

LeetCode 1-200题C++源码集锦

标题为“leetcode1-200题源码（c++）”，这表明文件包含的是在leetocde网站上编号为1至200的题目对应的C++编程源代码。LeetCode是一个面向技术面试准备者的在线编程平台，其中包含了大量与算法和数据结构相关的题目...