Kotlin
var transpose = { A: Array<IntArray> -> A[0].mapIndexed{ j, _ -> A.mapIndexed{ i, _ -> A[i][j] }.toIntArray() }.toTypedArray() }
Javascript
let transpose = A => A[0].map((_, j) => A.map((_, i) => A[i][j]));
// | |
// Recursively change each node of the linked list such that next | |
// is the last node seen during a linear scan of the linked list. | |
// | |
let reverseList = head => { | |
let go = (node = head, last = null) => { | |
let next = node.next; | |
node.next = last; | |
if (!next) | |
return node; |
// | |
// Recursively change each node of the linked list such that next | |
// is the last node seen during a linear scan of the linked list. | |
// | |
class Solution { | |
fun reverseList(head: ListNode?): ListNode? { | |
fun go(node: ListNode? = head, last: ListNode? = null): ListNode? { | |
var next = node?.next | |
node?.next = last | |
if (next == null) |
Kotlin
var transpose = { A: Array<IntArray> -> A[0].mapIndexed{ j, _ -> A.mapIndexed{ i, _ -> A[i][j] }.toIntArray() }.toTypedArray() }
Javascript
let transpose = A => A[0].map((_, j) => A.map((_, i) => A[i][j]));
Create a map m
to count the frequency of each implicit character c
of the string s
.
c
is explicit in Rust and C++Kotlin
var m = s.groupingBy{ it }.eachCount()
# https://en.wikipedia.org/wiki/Monty_Hall_problem | |
import random | |
N = int(1e5) | |
door = [1, 2, 3] | |
same = 0 | |
diff = 0 |
#!/bin/bash | |
git config --global user.name "claytonjwong" | |
git config --global user.email claytonjwong@gmail.com | |
git config --global alias.co checkout | |
git config --global alias.br branch | |
git config --global alias.ci commit | |
git config --global alias.st status | |
git config --global alias.au 'add . -u' | |
git config --global alias.di diff |