Speak Softly Love

摘要： Lombok[1]是通过注解[2]来解决JAVA程序中重复的代码。Lombok的实现原理是通过修改抽象语法树[3](AST)中的节点信息，然后生成对应的字节码文件[4]。如何编写自己的扩展，可以参考[5]。目前比较菜，会用就好了。 http://jnb.ociweb.com/jnb/jnbJan20 阅读全文

摘要： gradle是个构建工具，目的是为了更方便的管理项目。 学习gradle看下面的资料： 中文资料，总共六篇，看完之后基础差不多了： 简介 第一个Java项目 依赖管理 创建二进制发布版本 创建多项目构建 创建Web应用项目 英文资料就是官网，官网讲的也不错 https://docs.gradle.o 阅读全文

摘要： Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Subscribeto see which comp... 阅读全文

摘要： Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't mat... 阅读全文

摘要： Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.Do not allocate extra space for a... 阅读全文

摘要： Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a multiple ofkthen left-o... 阅读全文

摘要： Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文

摘要： Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.Subscribeto see which companies asked this question这道题... 阅读全文

摘要： Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文

摘要： Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Subscribe... 阅读全文