LastBattle - 博客园_a56爆大奖在线娱乐

搭建MAC下vim环境

摘要： MAC下的IDE实在是不好用，最终放弃了IDE准备直接用vim来看代码了，那么就需要设置一下vim。将家目录下面.vim中的vimrc用下面的内容替换：然后手动下载如下文件：之后在打开的vim中输入:PluginInstall来安装相应的插件，等待完成后就可以使用了。配置好的环境如下图所示：阅读全文

posted @ 2018-02-07 10:47 LastBattle 阅读(4917) 评论(0) 推荐(0) 编辑

解决MAC下xcrun: error: invalid active developer path (/Library/Developer/CommandLineTools)的问题

摘要：将系统升级到了最新10.13.3 macOS High Sierra后，在使用ctags命令时会出现如下问题： xcrun: error: invalid active developer path (/Library/Developer/CommandLineTools), missing xcr 阅读全文

posted @ 2018-02-06 17:44 LastBattle 阅读(8455) 评论(0) 推荐(0) 编辑

解决MAC下ctags -R无效的问题

摘要： MAC下自带了ctags，与a56爆大奖在线娱乐们常用的是不同的。 a56爆大奖在线娱乐们需要去重新下载一个ctags并重新安装 1、去http://ctags.sourceforge.net/下载Ctags的最新版本源代码 2、tar zxvf ctags-5.8.tar.gz 3、sudo ./configure && make 阅读全文

posted @ 2018-02-06 17:38 LastBattle 阅读(298) 评论(0) 推荐(0) 编辑

428. Pow(x, n)【medium】

摘要： Implement pow(x, n). Notice You don't need to care about the precision of your answer, it's acceptable if the expected answer and your answer 's diffe 阅读全文

posted @ 2018-02-04 19:24 LastBattle 阅读(210) 评论(0) 推荐(0) 编辑

149. Best Time to Buy and Sell Stock【medium】

摘要： 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 阅读全文

posted @ 2018-02-04 18:48 LastBattle 阅读(160) 评论(0) 推荐(0) 编辑

78. Longest Common Prefix【medium】

摘要： Given k strings, find the longest common prefix (LCP). Given k strings, find the longest common prefix (LCP). Given k strings, find the longest common 阅读全文

posted @ 2018-02-04 18:18 LastBattle 阅读(131) 评论(0) 推荐(0) 编辑

57. 3Sum【medium】

摘要： Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of 阅读全文

posted @ 2018-02-04 18:03 LastBattle 阅读(133) 评论(0) 推荐(0) 编辑

419. Roman to Integer【medium】

摘要： Given a roman numeral, convert it to an integer. The answer is guaranteed to be within the range from 1 to 3999. Have you met this question in a real 阅读全文

posted @ 2018-02-04 17:26 LastBattle 阅读(134) 评论(0) 推荐(0) 编辑

12. Min Stack【medium】

摘要： Implement a stack with min() function, which will return the smallest number in the stack. It should support push, pop and min operation all in O(1) c 阅读全文

posted @ 2018-02-04 11:57 LastBattle 阅读(200) 评论(0) 推荐(0) 编辑

1. A + B Problem【easy】

摘要： Write a function that add two numbers A and B. You should not use + or any arithmetic operators. Notice There is no need to read data from standard in 阅读全文

posted @ 2018-02-03 16:43 LastBattle 阅读(129) 评论(0) 推荐(0) 编辑

abc_begin

导航

公告