[重点短语] 01.at night 在晚上 02.in a more natural environment 在一个更加自然的环境中 03.all year round 一年到头,终年 04.be far from 离......远 05.in the dark 在黑暗中 06.in the past 在过去 07.have been to sw 去过某地 08.science museum科学博物馆 09.history museum 历史博物馆 10.amusement park 游乐园…
Meeting time: 2016.May.31 1:00~2:00 Chairperson: Kirill Zaitsev, from Mirantis Meeting summary: 1.Action Item Review update the wiki to mention new CPLs. kzaitsev_mb ping stable reviewers to review the backports. 2.Murano packages move into murano-a…
Other Awesome Go - A curated list of awesome Go frameworks, libraries and software Visual Studio Code for Mac Developers 1.0 Docker Tutorial for Beginners From Node.js to Go Your First ASP.NET Core Application on a Mac Using Visual Studio Code The Ba…
.NET .NET on Mac for the OS X n00b without Mono via Visual Studio Code Microsoft frameworks deprecation When everything you know is wrong, part one - two A Look at the Open Source JustDecompile Engine ASP.NET 5 On OS X : Getting Started ASP.NET 5: Ho…
最长不重复子串 public class Solution { public int lengthOfLongestSubstring(String s) { if(s==null || s.length()==0){return 0;} int len = s.length(),maxLen=0,slow=0,fast=0; HashMap<Character,Integer> map = new HashMap<Character,Integer>(); for(;fast&l…
Web Choosing a Web Framework/Language Combo for the Next Decade Optimizing NGINX and PHP-fpm for high traffic sites The Absolute Beginner's Guide to Node.js Node.js Performance Tip of the Week: CPU Profiling Improved JavaScript Intellisense in Visual…
Web Configuring Your .npmrc for an Optimal Node.js Environment Web Developer Security Checklist HTTPS on Stack Overflow: The End of a Long Road TypeScript 2.2: Mixin Classes Introducing the TypeScript Cookbook Performance Analysis Reference Golang Us…
描述 Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. For example, Given [3,2,1,5,6,4] and k = 2, return 5. Note: You may assume k is always valid, 1 ≤ k ≤ arr…
直接上代码 public class Solution { /* 做法是倒着遍历数组,目标是找到一个数比它前边的数大(即这个数后边的是降序排列),如果找到了那么这个数前边的那个数就是需要改变的最高位,如果找不到说明数组是倒序排列的,按照要求应该将数组倒过来.找到主要改变的最高位后要找谁和他交换,由于它前边的数不能变,所以那个数要倒着遍历[它+1,末尾]这个区间里的数,由于这个区间肯定是降序的,所以倒着找到的第一个就是应该交换的,交换之后的区间还是降序.这两步做完之后还要做一个工作,将这个区间的数…
Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order. Example 1: Input: "Let's take LeetCode contest" Output: "s'teL ekat edoCteeL tsetnoc"…