唯一摩尔斯密码词

最新推荐文章于 2021-03-09 07:52:47 发布

coolsunxu

最新推荐文章于 2021-03-09 07:52:47 发布

阅读量148

点赞数

分类专栏： LeetCode 文章标签： c++ leetcode

本文链接：https://blog.csdn.net/coolsunxu/article/details/89250225

版权

LeetCode 专栏收录该内容

459 篇文章 1 订阅

订阅专栏

class Solution {
public:
	int uniqueMorseRepresentations(vector<string>& words) {
		string label[26] = { ".-","-...","-.-.","-..",".",
							"..-.","--.","....","..",".---",
							"-.-",".-..","--","-.","---",
							".--.","--.-",".-.","...","-",
							"..-","...-",".--","-..-","-.--",
							"--.." };
		size_t m = words.size();

		if (m == 0) {
			return 0;
		}
		else {
            
			vector<string> str;
			string temp = "";
			for (int i = 0; i < m; i++) {
				temp = "";
				for (int j = 0; j < words[i].size(); j++) {
					temp += label[words[i][j] - 'a'];
				}
				str.push_back(temp);
			}

			sort(str.begin(), str.end());
			int count = 0;
			size_t str_size = str.size();
			for (int i = 0; i < str_size; i++) {
				if (i + 1 < str_size && str[i].compare(str[i + 1]) == 0) {
					count++;
				}
			}
			return str_size - count;
		}

	}
};