摘要:
https://leetcode.com/problems/top-k-frequent-elements/ Given a non-empty array of integers, return the k most frequent elements. For example,Given [1, 阅读全文
posted @ 2016-05-20 23:43
浩然119
阅读(860)
评论(0)
推荐(0)
摘要:
https://leetcode.com/problems/power-of-four/ Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example:Given nu 阅读全文
posted @ 2016-05-20 19:19
浩然119
阅读(223)
评论(0)
推荐(0)
摘要:
Linux对于每个用户,系统限制其最大进程数。为提高性能,可以根据设备资源情况,设置各linux 用户的最大进程数。可以用ulimit -a 来显示当前的各种用户进程限制。 Linux/Unix ulimit命令详解http://www.linuxidc.com/Linux/2012-10/7278 阅读全文
posted @ 2016-05-20 10:50
浩然119
阅读(234)
评论(0)
推荐(0)
摘要:
https://leetcode.com/problems/reverse-vowels-of-a-string/ Write a function that takes a string as input and reverse only the vowels of a string. Examp 阅读全文
posted @ 2016-05-20 00:48
浩然119
阅读(335)
评论(0)
推荐(0)
浙公网安备 33010602011771号