LeetCode题解（九）0800-0899，androidapk性能优化

804. Unique Morse Code Words

[Description]

International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes,

as follows: “a” maps to “.-”, “b” maps to “-…”, “c” maps to “-.-.”, and so on.

For convenience, the full table for the 26 letters of the English alphabet is given below:

[".-","-…","-.-.","-…",".","…-.","–.","…","…",".—","-.-",".-…","–","-.","—",".–.","–.-",".-.","…","-","…-","…-",".–","-…-","-.–","–…"]

Now, given a list of words, each word can be written as a concatenation of the Morse code of each letter.

For example, “cba” can be written as “-.-…–…”, (which is the concatenation “-.-.” + “-…” + “.-”). We’ll call such a concatenation, the transformation of a word.

Return the number of different transformations among all words we have.

Example:

Input: words = [“gin”, “zen”, “gig”, “msg”]

Output: 2

Explanation:

The transformation of each word is:

“gin” -> “–…-.”

“zen” -> “–…-.”

“gig” -> “–…–.”

“msg” -> “–…–.”

There are 2 different transformations, “–…-.” and “–…–.”.

Note:

The length of words will be at most 100.

Each words[i] will have length in range [1, 12].

words[i] will only consist of lowercase letters.

a .-

b -…

c -.-.

d -…

e .

f …-.

g --.

h …

i …

j .—

k -.-

l .-…

m –

n -.

o —

p .–.

q --.-

r .-.

s …

t -

u …-

v …-

w .–

x -…-

y -.–

z --…

[Answer]

Runtime: 2 ms, faster than 80.74% of Java online submissions for Unique Morse Code Words.

Memory Usage: 35.4 MB, less than 98.71% of Java online submissions for Unique Morse Code Words.

class Solution {

public int uniqueMorseRepresentations(String[] words) {

if(words == null || words.length ==0)

return 0;

String[] morse = {".-","-…","-.-.","-…",".","…-.","–.","…","…",".—","-.-",".-…","–","-.","—",".–.","–.-",".-.","…","-","…-","…-",".–","-…-","-.–","–…"};

HashSet set = new HashSet<>();

int count = 0;

for(int i = 0; i < words.length; i++) {

StringBuffer sb = new StringBuffer();

for(char c : words[i].toCharArray()) {

sb.append(morse[c - ‘a’]);

}

if (!set.contains(sb.toString())) {

count ++;

set.add(sb.toString());

}

}

return count;

}

}

class Solution {

public int uniqueMorseRepresentations(String[] words) {

if (words == null || words.length == 0)

return 0;

String[] code = { “.-”, “-…”, “-.-.”, “-…”, “.”, “…-.”, “–.”, "…

《Android学习笔记总结+最新移动架构视频+大厂安卓面试真题+项目实战源码讲义》

【docs.qq.com/doc/DSkNLaERkbnFoS0ZF】 完整内容开源分享

…", “…”, “.—”, “-.-”, “.-…”, “–”,

“-.”, “—”, “.–.”, “–.-”, “.-.”, “…”, “-”, “…-”, “…-”, “.–”, “-…-”, “-.–”, “–…” };

HashSet set = new HashSet<>();

int count = 0;

for (int i = 0; i < words.length; i++) {

StringBuilder sb = new StringBuilder();

for (char c : words[i].toCharArray())

sb.append(code[c - ‘a’]);

if (!set.contains(sb.toString())) {

count++;

set.add(sb.toString());

}

}

return count;

}

}

832. Flipping an Image

[Description]

Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image.

To flip an image horizontally means that each row of the image is reversed. For example, flipping [1, 1, 0] horizontally results in [0, 1, 1].

To invert an image means that each 0 is replaced by 1, and each 1 is replaced by 0. For example, inverting [0, 1, 1] results in [1, 0, 0].

Example 1:

Input: [[1,1,0],[1,0,1],[0,0,0]]

Output: [[1,0,0],[0,1,0],[1,1,1]]

Explanation: First reverse each row: [[0,1,1],[1,0,1],[0,0,0]].

Then, invert the image: [[1,0,0],[0,1,0],[1,1,1]]

Example 2:

Input: [[1,1,0,0],[1,0,0,1],[0,1,1,1],[1,0,1,0]]

Output: [[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]]

Explanation: First reverse each row: [[0,0,1,1],[1,0,0,1],[1,1,1,0],[0,1,0,1]].

Then invert the image: [[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]]

Notes:

1 <= A.length = A[0].length <= 20

0 <= A[i][j] <= 1

Answer:

Runtime: 0 ms, faster than 100.00% of Java online submissions for Flipping an Image.

Memory Usage: 36.6 MB, less than 99.91% of Java online submissions for Flipping an Image.

class Solution {

public int[][] flipAndInvertImage(int[][] A) {

int[][] B = new int[A.length][A[0].length];

for(int i = 0; i < A.length; i++) {

for(int j = 0; j < A[i].length; j++)