Kelvinson

"""
Minimal character-level Vanilla RNN model. Written by Andrej Karpathy (@karpathy)
BSD License
"""
import numpy as np

# data I/O
data = open('input.txt', 'r').read() # should be simple plain text file
chars = list(set(data))
data_size, vocab_size = len(data), len(chars)

Kelvinson

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

class Node{

Kelvinson

	/**
	 * This solution does not to store the whole link of nodes
	 * only the first half is needed to be stored so it is friendly 
	 * for space complexity. It use fast runner and slow runner to 
	 * find the middle point of the list of node.
	 * @param list
	 * @return
	 */
	
	// Note: When I implemented this method I made two mistakes:

Kelvinson

public static Node reverseAndClone(Node list) {
		Node head = null;
		while (list != null) {
			Node n = new Node(list.val);
			n.next = head;
			head = n;
			list = list.next;
		}
		return head;
	}