yuijam

#Array #BFS #CSS #DFS #HashTable #Heap #Leetcode #LinkedList #Linux #Lua #Next #React #Recursive #Stack #Tree #Ubuntu #aws #computer-networking #dart #docker #es6 #flutter #haskell #jekyll #js #k8s #leetcode #marble.js #mock #nginx #rxjs #security #sql #ts #ubuntu #vue #web #webpack

// 80ms 92.47%  38.3mb 34.88%
/**
 * @param {string} s
 * @param {string} t
 * @return {boolean}
 */
var isAnagram = function(s, t) {
	let a = [...Array(26)].map(_=>0)
	let b = [...Array(26)].map(_=>0)
	for (let i of s){
		a[i.charCodeAt()-97]++
	}
	for (let i of t){
		b[i.charCodeAt()-97]++
	}
	for (let i = 0; i < 26; i++){
		if (a[i] !== b[i]) return false
	}
	return true
};

function ListNode(val) {
	this.val = val;
	this.next = null;
}

var reverseList = function(head) {
	let pre = null, n = null
	while(head){
		n = head.next
		head.next = pre
		pre = head
		head = n
	}
	return pre
};

let l1 = new ListNode(1)
let l2 = new ListNode(2)
let l3 = new ListNode(3)
let l4 = new ListNode(4)
let l5 = new ListNode(5)
l1.next = l2
l2.next = l3
l3.next = l4
l4.next = l5

let n = reverseList(l1)
while(n){
	console.log(n.val)
	n = n.next
}

# 无脑暴力解 3848 ms (27.38%) 11.8 MB
def twoSum(self, nums, target):
	"""
	:type nums: List[int]
	:type target: int
	:rtype: List[int]
	"""
	for i in range(len(nums) - 1):
		for j in range(i+1, len(nums)):
			if nums[i] + nums[j] == target:
				return [i, j]

local M = {}
local modname = 'a'
_G[modname] = M
package.loaded[modname] = M

function M.play()
    print('play')
end

function M.say()
    print('say')
    M.play()
end

return M