題目

Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false.

Each letter in the magazine string can only be used once in your ransom note.

Note:
You may assume that both strings contain only lowercase letters.

canConstruct("a", "b") -> false
canConstruct("aa", "ab") -> false
canConstruct("aa", "aab") -> true

解題思路

把magazine上的字符串放進map中，值是字符出現(xiàn)的數(shù)量，然后循環(huán)遍歷ransom上的字符，如果map中有則值減一，如果沒有或者值為0則返回false

代碼

ransomNote.go

package _383_Ransom_Note


func CanConstruct(ransomNote string, magazine string) bool {
    var magazineMap map[rune]int
    magazineMap = make(map[rune]int)
    magazineRune := []rune(magazine)

    for _, v := range magazineRune {
        magazineMap[v]++
    }

    ransomNoteRune := []rune(ransomNote)
    for _, letter := range ransomNoteRune {
        tmp, ok := magazineMap[letter]
        if !ok || tmp <= 0 {
            return false
        } else {
            magazineMap[letter]--
        }
    }

    return true
}

測試

ransomNote_test.go

package _383_Ransom_Note

import "testing"

func TestCanConstruct(t *testing.T) {
    var tests = []struct{
        a string
        b string
        output bool
    } {
        {"aa", "ab", false},
    }

    for _, test := range tests {
        ret := CanConstruct(test.a, test.b)

        if ret == test.output {
            t.Logf("pass")
        } else {
            t.Errorf("fail, want %+v, get %+v", test.output, ret)
        }
    }
}