摘要：
Description Given an integer array , find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Examp 阅读全文
摘要：
Description Given an array , write a function to move all s to the end of it while maintaining the relative order of the non zero elements. Example: N 阅读全文
摘要：
Description Alice and Bob take turns playing a game, with Alice starting first. Initially, there is a number on the chalkboard. On each player's turn, 阅读全文
摘要：
Description Given a $m \times n$ grid filled with non negative numbers, find a path from top left to bottom right which minimizes the sum of all numbe 阅读全文
摘要：
Description A robot is located at the top left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or ri 阅读全文
摘要：
书上关于GCTimeRatio的讲解有点难以理解，查看Oracle的文档后重新理解了下 -XX:GCTimeRatio 用户程序运行时间 / GC时间 当GCTimeRatio为19时，运行时间是GC时间的19倍，也就是GC时间不能超过 1 / (1 + 19) = 0.05 附上Oracle的文档 阅读全文
摘要：
Description Given a binary matrix , we want to flip the image horizontally, then invert it, and return the resulting image. To flip an image horizonta 阅读全文
摘要：
Description Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Given linked list head = [4,5 阅读全文
摘要：
Description Given an array of integers , write a method that returns the "pivot" index of this array. We define the pivot index as the index where the 阅读全文
摘要：
传统的IDE安装之后都会在文件夹的右键菜单中增加如【Open in Visual Studio】或者【Open Folder as IntelliJ IDEA Project】这样的选项 但VS Code作为一个轻量级的Editor安装完毕之后并没有这个菜单，这里手动通过修改注册表来增加这个菜单 使 阅读全文
摘要：
使用apache代理生成的wss服务常出现 的问题，但多刷新几次页面就能连接成功 在官方文档没找到办法，最后在 "https://github.com/ratchetphp/Ratchet/issues/645" 找到了解决方案 这个不是Workerman的仓库，但解决办法是通用的 I could 阅读全文
摘要：
Android Studio是我学习Android开发路上的第一块绊脚石，新建一个项目，一行代码没动，直接编译不起来，我太难了，所以本文叫指北 本文讲解在9102年如何在国内网络不通畅的情况下流畅的使用Android Studio 1. 关闭代理 网上能搜索出一堆通过增加国内镜像站的代理来使下载SD 阅读全文
摘要：
Given a function which generates a uniform random integer in the range 1 to 7, write a function which generates a uniform random integer in the range 阅读全文
摘要：
Description e Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n = 0. Given , return the value of 阅读全文
摘要：
key value 通过key获取或设置value SET key value GET key : SET if not exists : +1 原子操作 给key设置过期时间 获取一个key的存活时间，每次set一个key的value，过期时间将会重置 已过期 永不过期 list 插入数据到lis 阅读全文