brew install gnatsd
[NATS)(https://www.nats.io/documentation/tutorials/gnatsd-install/)
-
Create Server 1 server1.conf
-
Create Server 2 server2.conf
| function findMedian(input1, input2) { | |
| let resultList = sortLists(input1 || [], input2 || []); | |
| if (resultList.length > 0) { | |
| let medianIdx = Math.floor(resultList.length / 2); | |
| if (resultList.length % 2 === 0) { | |
| return (resultList[medianIdx - 1] + resultList[medianIdx]) / 2; | |
| } else { | |
| return resultList[medianIdx]; | |
| } |
| public class LinkedList { | |
| private Node head; | |
| private Node current; | |
| private boolean isFirst = false; | |
| private int length; | |
| public LinkedList() { | |
| } |
brew install gnatsd
[NATS)(https://www.nats.io/documentation/tutorials/gnatsd-install/)
Create Server 1 server1.conf
Create Server 2 server2.conf
| public class Rotator { | |
| public String rotate(String input, int maxRotations) { | |
| int current = -1; | |
| char[] letters = input.toCharArray(); | |
| final String original = input; | |
| int start = input.length() - maxRotations; | |
| // | |
| for (int i = 0; i < letters.length; i++) { |
| 'use strict'; | |
| const repos = require('./repos'); | |
| const FS = require('fs'); | |
| const trieDataSet = require('./trie-dataset'); | |
| const Util = require('util'); | |
| module.exports = Trie; | |
| function Trie() { |
| 'use strict'; | |
| // const repos = require('./repos'); | |
| const FS = require('fs'); | |
| // const trieDataSet = require('./trie-dataset'); | |
| const Util = require('util'); | |
| const Path = require('path'); | |
| const modUtils = require('../mod-utils'); | |
| const DATASET_PATH = process.env.DATASET_PATH; |
| 'use strict'; | |
| const dataset = require('./trie-dataset'); | |
| // let wordmap = [{ | |
| // name: 'r', | |
| // children: [{ | |
| // name: 'a', | |
| // children: [{ | |
| // name: 'm', |
| function find(inputStr) { | |
| var deleteCount = 0; | |
| let prefix = ''; | |
| var visited = {}; | |
| var lastIdx = -1; | |
| var previous; | |
| for (var i = 0; i < inputStr.length; i++) { | |
| var current = inputStr.charAt(i); | |
| if (previous === current) { | |
| if (prefix.length > 0) { |
| function find(input) { | |
| let prefix = input[0]; | |
| for (var i = 1; i < input.length; i++) { | |
| let current = input[i]; | |
| if (current.length < prefix.length && prefix.startsWith(current)) { | |
| prefix = current; | |
| } else { | |
| for (var j = 0; j < prefix.length; j++) { | |
| if (current.charAt(j) === prefix.charAt(j)) { |