Chen-tao

/*
Copyright (c) 2016, Nitin Gode
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
    * Redistributions of source code must retain the above copyright
      notice, this list of conditions and the following disclaimer.
    * Redistributions in binary form must reproduce the above copyright
      notice, this list of conditions and the following disclaimer in the

Chen-tao

package main

import (
	"html/template"
	"net/http"
)

//AntiXSS is main struct on auto AntiXss Handler
type AntiXSS struct {
	http.Handler

Chen-tao

#!/usr/bin/python
# -*- coding: utf-8 -*-
# unzip-gbk.py

import os
import sys
import zipfile

print "Processing File " + sys.argv[1]

Chen-tao

/**
 *
 * @author tadchen
 * @version 2017年2月9日
 * @description TODO
 */
public class OctKanji {
	
	public static void main(String[] args) throws Exception {
		String str = URLEncoder.encode("大家好。", "UTF-8");

Chen-tao

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {

Chen-tao

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
/**
 * Definition for a binary tree node.

Chen-tao

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {

Chen-tao

//Java Solution 1 - Iterative

public ListNode reverseList(ListNode head) {
    if(head==null||head.next==null)
        return head;
 
    ListNode p1 = head;
    ListNode p2 = p1.next;
 

Chen-tao

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public void deleteNode(ListNode node) {

Chen-tao

public class LFUCache {

    Node head = null;
    final int capacity;
    Map<Integer, Integer> valueMap;
    Map<Integer, Node> nodeMap;

    public LFUCache (int capacity) {
        this.capacity = capacity;
        valueMap = new HashMap<>(this.capacity, 1f);