摘要：
解决方案 1、利用vi编辑器打开 /etc/bash.bashrc文件（需要root权限） sudo vi /etc/bash.bashrc 2、找到文件中的下列代码 #enable bash completion in interactive shells #if ! shopt -oq posi 阅读全文
posted @ 2018-04-11 10:40
bonelee
阅读(2608)
评论(0)
推荐(0)
摘要：
Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. 阅读全文
posted @ 2018-04-10 23:35
bonelee
阅读(209)
评论(0)
推荐(0)
摘要：
发现自己写python的空格split还挺多坎的，尤其是最后一个是空格的情形： 阅读全文
posted @ 2018-04-09 10:11
bonelee
阅读(362)
评论(0)
推荐(0)
摘要：
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This 阅读全文
posted @ 2018-04-08 21:40
bonelee
阅读(255)
评论(0)
推荐(0)
摘要：
In a given integer array nums, there is always exactly one largest element. Find whether the largest element in the array is at least twice as much as 阅读全文
posted @ 2018-04-06 22:41
bonelee
阅读(345)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For 阅读全文
posted @ 2018-04-06 22:27
bonelee
阅读(177)
评论(0)
推荐(0)
摘要：
Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray). Example 1: Input: [1,3,5,4,7] Output: 3 阅读全文
posted @ 2018-04-06 22:07
bonelee
阅读(230)
评论(0)
推荐(0)
摘要：
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-04-06 21:51
bonelee
阅读(166)
评论(0)
推荐(0)
摘要：
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. Y 阅读全文
posted @ 2018-04-06 21:16
bonelee
阅读(190)
评论(0)
推荐(0)
摘要：
Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there ar 阅读全文
posted @ 2018-04-06 20:47
bonelee
阅读(161)
评论(0)
推荐(0)
浙公网安备 33010602011771号