If given a choice

最新推荐文章于 2024-07-24 11:40:30 发布
最新推荐文章于 2024-07-24 11:40:30 发布
阅读量221 收藏
点赞数 1
文章标签： less go
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/xyyywzh/article/details/6068783
版权

If given a choice,I would go to the past;

If given a choice,I would live another life;

If given a choice,I would make less mistakens;

If given a choice,I would open the door of my heart

              to that girl;

And if given a choice,I must be happier!

 

xyyywzh
关注
  • 1
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Matlab：成功解决The option is not valid. The options must be'double','native','default','omitnan', or'inc
近期请国内外头部出版社可尽快私信博主！——心比天高，仗剑走天涯，保持热爱，奔赴向梦想！低调，谦虚，自律，反思，成长，还算是比较正能量的博主，公益免费传播……内心特别想在AI界做出一些可以推进历史进程影响力的东西(兴趣使然，有点小情怀，也有点使命感呀)…
07-11 9828
Matlab：成功解决The option is not valid. The options must be'double','native','default','omitnan', or'inc 目录 解决问题 解决方法 解决问题 The option is not valid. The options must be'double','native','defa...
sybase sql anywhere 5.0 安装后sybase central中无法打开视图等的解决办法
weixin_30319097的博客
07-21 436
无法打开的原因初步分析要用英文版的xp，后来在如下处发现问题，是sql anywhere的版本太旧了， 可能没有使用Unicode编码，设置一下如下选项可以解决问题。 转载于:https://www.cnblogs.com/yzl495/p/4665725.html...
Error: required args ＜xml=string＞ at error (index.esm.js?93ce:68:1) at Parser.parse (index.e
weixin_45966674的博客
08-06 1076
这个问题主要还是异步处理 还没有捕获异常的问题。原本我是这样写的 就报了这个错误。
解决VS打开文件出现No EditorOptionDefinition export found for the given option name问题
BlinkZero的博客
07-14 4165
转载自http://stackoverflow.com/questions/23893497/no-editoroptiondefinition-export-found-error的第一个回答 After a reboot and some more research I found this post from a blog. The error described is
random.choice()
kejizuiqianfang的博客
08-22 5498
概述： 可以从一个int数字或1维array里随机选取内容，并将选取结果放入n维array中返回。 说明： numpy.random.choice(a, size=None, replace=True, p=None) a : 1-D array-like or int If an ndarray, a random sample is generated from its e...
java的choice什么意思_choice是什么意思_choice的翻译_音标_读音_用法_例句_爱词霸在线词典...
weixin_42470300的博客
02-26 1099
全部四级六级高考考研Either way, we have choices about how we respond to it when it comes.出自-2017年6月阅读原文SimpliSafe, winner of our Editor's Choice distinction, utilizes a special system that's capable of separati...
java方法choice怎么用_Java Int.choice方法代码示例
weixin_29066781的博客
02-26 597
import kodkod.engine.bool.Int; //导入方法依赖的package包/类/*** Translates the given sum expression as follows* (where A_0...A_|A| stand for boolean variables that represent the* tuples of the expression A, et...
LTE from A to Z
05-11
1.2.3.4.2 MBMS operation with a SFN.................................................24 1.2.3.4.3 SFN for point to point services..............................................25 1.2.3.5 The Frequency ...
Building.a.Recommendation.System.with.R.1783554495
10-12
If you are a competent developer with some knowledge of machine learning and R, and want to further enhance your skills to build recommendation systems, then this book is for you. What You Will Learn...
LTE from A to Z (part1 of 3)
05-11
1.2.3.4.2 MBMS operation with a SFN.................................................24 1.2.3.4.3 SFN for point to point services..............................................25 1.2.3.5 The Frequency ...
LTE from A-Z 培训教材 （part2 of 3)
05-13
1.2.3.4.2 MBMS operation with a SFN.................................................24 1.2.3.4.3 SFN for point to point services..............................................25 1.2.3.5 The Frequency ...
CareerCup Find all the conflicting appointments from a given list of n appointments.
taoqick的专栏
03-02 1229
You are given 'n' appointments. Each appointment contains startime and endtime. You have to return all conflicting appointments efficiently starttime and endtime can range from a few min to few year
CSS、less、 Sass、
qq_33715850的博客
07-24 384
CSS、less、 Sass、
chromedriver-mac-arm64_126.0.6474.0.zip
07-31
chromedriver-mac-arm64_126.0.6474.0.zip
chromedriver-mac-arm64_128.0.6548.0.zip
07-31
chromedriver-mac-arm64_128.0.6548.0.zip
MySQL查询加速器：利用Query Cache提升效率
07-31
MySQL是一个流行的开源关系型数据库管理系统（RDBMS），广泛用于Web应用程序的后端数据存储。它基于结构化查询语言（SQL）来管理数据，并且是LAMP（Linux, Apache, MySQL, PHP/Python/Perl）技术栈的一部分，这个技术栈常用于构建动态网站和Web应用程序。 MySQL的特点包括： - **开放源代码**：MySQL的源代码是公开的，任何人都可以自由使用和修改。 - **跨平台**：MySQL可以在多种操作系统上运行，包括Linux、Windows、macOS等。 - **高性能**：MySQL以其快速的查询处理和良好的性能而闻名。 - **可靠性**：MySQL提供了多种机制来确保数据的完整性和可靠性，包括事务支持、备份和恢复功能。 - **易于使用**：MySQL提供了简单直观的界面和丰富的文档，便于用户学习和使用。 - **可扩展性**：MySQL支持从小型应用到大型企业级应用的扩展。 - **社区支持**：由于其广泛的使用，MySQL拥有一个活跃的开发者社区，提供大量的资源和支持。 MySQL被广泛应用于各种场景，包括在线事务处理（OL
Objective-C语言的基础教程.md
最新发布
07-31
Objective-C是一种面向对象的编程语言，是C语言的扩展。它主要用于苹果的iOS和macOS应用程序开发。
outputstandard output You are given a string s consisting of the characters 0, 1 and/or ?. Let's call it a pattern. Let's say that the binary string (a string where each character is either 0 or 1) matches the pattern if you can replace each character ? with 0 or 1 (for each character, the choice is independent) so that the strings become equal. For example, 0010 matches ?01?, but 010 doesn't match 1??, ??, or ????. Let's define the cost of the binary string as the minimum number of operations of the form "reverse an arbitrary contiguous substring of the string" required to sort the string in non-descending order. You have to find a binary string with the minimum possible cost among those that match the given pattern. If there are multiple answers, print any of them.
05-26
This is an interesting problem! To solve it, you can use dynamic programming. Let dp[i][j] be the minimum cost to sort the first i characters of the pattern such that the i-th character is j (0 or 1). The base case is dp[0][0]=dp[0][1]=0, since an empty string is already sorted. Then, to compute dp[i][j], you can consider the last character of the pattern, which can be either 0, 1, or ?. If it's 0 or 1, you can simply match it with the i-th character of the binary string, and update dp[i][j] accordingly. If it's ?, you need to try both possibilities (0 or 1) and take the minimum cost. The final answer is the minimum of dp[n][0] and dp[n][1], where n is the length of the pattern. Here's the Python code: ``` s = input().strip() n = len(s) dp = [[float('inf')]*2 for _ in range(n+1)] dp[0][0] = dp[0][1] = 0 for i in range(1, n+1): if s[i-1] == '0': dp[i][0] = min(dp[i-1][0], dp[i-1][1]+1) elif s[i-1] == '1': dp[i][1] = min(dp[i-1][1], dp[i-1][0]+1) else: dp[i][0] = min(dp[i-1][0], dp[i-1][1]+1) dp[i][1] = min(dp[i-1][1], dp[i-1][0]+1) ans = [''] * n if dp[n][0] <= dp[n][1]: i, j = n, 0 while i > 0: if s[i-1] == '0': ans[i-1] = '0' i, j = i-1, 0 elif s[i-1] == '1': ans[i-1] = '1' i, j = i-1, 1 else: if dp[i][j] == dp[i-1][0]: ans[i-1] = '0' i, j = i-1, 0 else: ans[i-1] = '1' i, j = i-1, 1 else: i, j = n, 1 while i > 0: if s[i-1] == '0': ans[i-1] = '0' i, j = i-1, 0 elif s[i-1] == '1': ans[i-1] = '1' i, j = i-1, 1 else: if dp[i][j] == dp[i-1][1]: ans[i-1] = '1' i, j = i-1, 1 else: ans[i-1] = '0' i, j = i-1, 0 print(''.join(ans)) ``` Hope this helps!
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值