| node_modules/ |
| def countChange(money: Int, coins: List[Int]): Int = | |
| if (money < 0 || coins.isEmpty) | |
| 0 | |
| else if (money == 0) | |
| 1 | |
| else | |
| countChange(money - coins.head, coins) + countChange(money, coins.tail) |
| package forcomp | |
| import common._ | |
| object Anagrams { | |
| type Word = String | |
| type Sentence = List[Word] |
| def sentenceAnagrams(sentence: Sentence): List[Sentence] = { | |
| def subSentence(occ: Occurrences): List[Sentence] = { | |
| if (occ.isEmpty) List(List()) | |
| else | |
| for { | |
| x <- combinations(occ) | |
| y <- dictionaryByOccurrences(x) | |
| z <- subSentence(subtract(occ, x)) | |
| } yield y :: z |
Sometimes you want to have a subdirectory on the master branch be the root directory of a repository’s gh-pages branch. This is useful for things like sites developed with Yeoman, or if you have a Jekyll site contained in the master branch alongside the rest of your code.
For the sake of this example, let’s pretend the subfolder containing your site is named dist.
Remove the dist directory from the project’s .gitignore file (it’s ignored by default by Yeoman).
| class DeBruijnGraph: | |
| """ A de Bruijn multigraph built from a collection of strings. | |
| User supplies strings and k-mer length k. Nodes of the de | |
| Bruijn graph are k-1-mers and edges correspond to the k-mer | |
| that joins a left k-1-mer to a right k-1-mer. """ | |
| @staticmethod | |
| def chop(st, k): | |
| """ Chop a string up into k mers of given length """ | |
| for i in xrange(0, len(st)-(k-1)): |
| __author__ = 'robert' | |
| """ | |
| Implementation inspired by Petr Mitrichev's blog post http://petr-mitrichev.blogspot.co.nz/2013/05/fenwick-tree-range-updates.html | |
| and | |
| Yoshiya Miyata's Quora answer http://qr.ae/pHhNN | |
| """ | |
| class Bit: | |
| def __init__(self, n): |
| #!/usr/bin/env python | |
| # -*- coding: utf-8 | |
| """ | |
| Search longest common substrings using generalized suffix trees built with Ukkonen's algorithm | |
| Author: Ilya Stepanov <code at ilyastepanov.com> | |
| (c) 2013 | |
| """ |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
| /** | |
| * Assignment 4: Huffman coding | |
| * | |
| */ | |
| object Huffman1 { | |
| abstract class CodeTree | |
| case class Fork(left: CodeTree, right: CodeTree, chars: List[Char], weight: Int) extends CodeTree | |
| case class Leaf(char: Char, weight: Int) extends CodeTree |
