”,“bell”]

Method 1 - Sort Strings in Desc Order by Length and Generate All Suffices and Check Uniqueness by Set

Algo

Create a tuple of each word and its length from the input list and store them in a new list called nodeList.
Sort nodeList in descending order based on the length of the words.
For each word in nodeList, generate all possible suffixes:
- If a suffix does not exist in the set, add it to the set and increment the result length.
- If a suffix already exists, continue to the next word.

Code

[{"language":"Java","code":"public int minimumLengthEncoding(String[] words) {\n\tclass Node {\n\t\tString s;\n\t\tint len;\n\t\n\t\tNode(String s, int len) {\n\t\t\tthis.s = s;\n\t\t\tthis.len = len;\n\t\t}\n\t}\n\tList<Node> list = new ArrayList<>();\n\tfor (String w : words) {\n\t\tlist.add(new Node(w, w.length()));\n\t}\n\tlist.sort((o1, o2) -> Integer.compare(o2.len, o1.len));\n\n\tSet<String> set = new HashSet<>();\n\n\tint ans = 0;\n\tfor (Node node : list) {\n\t\tString str = node.s;\n\t\tif (!set.contains(str)) {\n\t\t\tfor (int i = 0, l = str.length(); i < l; i++) {\n\t\t\t\tset.add(str.substring(i, l));\n\t\t\t}\n\t\t\tans += (str.length() + 1);// +1 for `#`\n\t\t}\n\t}\n\treturn ans;\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> int</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> minimumLengthEncoding</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">String</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">[] words) {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">\tclass</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Node</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">\t\tString s;</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">\t\tint</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> len;</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">\t</span></span>\n<span class=\"line\"><span style=\"color:#6F42C1;--shiki-dark:#B392F0\">\t\tNode</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(String </span><span style=\"color:#E36209;--shik

Related Tags