(Easy) Most Common Word - LeetCode

Description:

Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words.  It is guaranteed there is at least one word that isn't banned, and that the answer is unique.

Words in the list of banned words are given in lowercase, and free of punctuation.  Words in the paragraph are not case sensitive.  The answer is in lowercase.

 

Example:

Input: 
paragraph = "Bob hit a ball, the hit BALL flew far after it was hit."
banned = ["hit"]
Output: "ball"
Explanation: 
"hit" occurs 3 times, but it is a banned word.
"ball" occurs twice (and no other word does), so it is the most frequent non-banned word in the paragraph. 
Note that words in the paragraph are not case sensitive,
that punctuation is ignored (even if adjacent to words, such as "ball,"), 
and that "hit" isn't the answer even though it occurs more because it is banned.

 

Note:

  • 1 <= paragraph.length <= 1000.
  • 0 <= banned.length <= 100.
  • 1 <= banned[i].length <= 10.
  • The answer is unique, and written in lowercase (even if its occurrences in paragraph may have uppercase symbols, and even if it is a proper noun.)
  • paragraph only consists of letters, spaces, or the punctuation symbols !?',;.
  • There are no hyphens or hyphenated words.
  • Words only consist of letters, never apostrophes or other punctuation symbols.
Accepted
73,213
Submissions
172,048

Solution:

Accepted

复制代码
class Solution {
    public String mostCommonWord(String paragraph, String[] banned) {
        
       if(paragraph ==null||paragraph.length()==0){
           return "";
       }
        
        String[] res =  paragraph.toLowerCase().split("[ !?',;.]+"); //very important. 
        
        int max = -1;
        
        String result = "";
        
        for(int i = 0; i<res.length; i++){
        
           // System.out.println(" "+i+" "+res[i]+" "+Count(res,res[i]));
            
            if(Count(res, res[i])>max && Count(banned, res[i])==0){
                
                max = Count(res,res[i]);
                
                result = res[i];
               // System.out.println(" "+i+" "+result+" "+max);
                }
        }
        
        return result;
        
    }
    
    public static int Count(String[] arr, String s){
        
        int count = 0;
        for(int i = 0; i<arr.length; i++){
            if(arr[i].equals( s)){
                count++;
            }
        }
        
        return count; 
    }
}
复制代码

 

posted @ 2019-09-04 12:13  CodingYM  阅读(198)  评论(0)    收藏  举报
编辑推荐:
· 《C#高级GDI+实战:从零开发一个流程图》增加贝塞尔曲线
· AES 加密模式演进:从 ECB、CBC 到 GCM 的 C# 深度实践
· InnoDB为什么不用跳表,Redis为什么不用B+树?
· 记一次 C# 平台调用中因非托管 union 类型导致的内存访问越界
· [EF Core]聊聊“复合”属性
阅读排行:
· 博客园众包:再次诚征3D影像景深延拓实时处理方案(预算8-15万,需求有调整)
· 扣子(Coze),开源了!Dify 天塌了
· 精选 5 款 .NET 开源、功能强大的工作流系统,告别重复造轮子!
· 从经典产品看大模型方向
· 爆肝2月,我的 AI 代码生成平台上线了!
点击右上角即可分享
微信分享提示