renlei0109的专栏

/** * */ package jp.co.worksap.global; import java.util.ArrayList; import java.util.List; import java.util.NoSuchElementException; import java.util.Queue; import javax.print.attribute.Size2DSynta

package org.lei.test; import java.util.ArrayList; import java.util.Collections; import java.util.List; public class BigData {          static void reverse(char s[],int len)       {        

package two_stack_to_queue; import java.util.Stack; /** * Created by renren on 16/8/3. * * 通过两个栈实现队列 * * * 原理思想: * 建两个栈，stackNewest和stackOldest。要始终保持：newStack的栈顶总是存放着最新的元素，oldStack的栈顶总是存放着最旧

package two_stack_to_queue; import java.util.LinkedList; import java.util.Queue; import java.util.concurrent.LinkedBlockingDeque; /** * Created by renren on 16/8/3. * * 思路 * 假设有两个队列Q1和Q2，当二者都为空

package thread; import java.util.concurrent.Executor; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; /** * Created by renren on 16/8/10. */ public class Produc

/** * Created by renren on 16/9/2. */ public class StringToInteger { public static void main(String[] args) { System.out.println(StringtoInteger("-98403829")); System.out.printl