zoukankan      html  css  js  c++  java
  • #Leetcode# 522. Longest Uncommon Subsequence II

    https://leetcode.com/problems/longest-uncommon-subsequence-ii/

    Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not be anysubsequence of the other strings.

    A subsequence is a sequence that can be derived from one sequence by deleting some characters without changing the order of the remaining elements. Trivially, any string is a subsequence of itself and an empty string is a subsequence of any string.

    The input will be a list of strings, and the output needs to be the length of the longest uncommon subsequence. If the longest uncommon subsequence doesn't exist, return -1.

    Example 1:

    Input: "aba", "cdc", "eae"
    Output: 3
    

    Note:

    1. All the given strings' lengths will not exceed 10.
    2. The length of the given list will be in the range of [2, 50].

    代码:

    class Solution {
    public:
        int findLUSlength(vector<string>& strs) {
            int n = strs.size();
            
            map<string, int> mp, vis;
            int maxx = -1;
            vis.clear();
            for(int i = 0; i < n; i ++) {
                mp[strs[i]] ++;
                if(mp[strs[i]] > 1) vis[strs[i]] = 1;
            }
            
            for(int i = 0; i < n; i ++) {
                for(int j = 0; j < n; j ++) {
                    if(vis[strs[i]] && issame(strs[i], strs[j]))
                        vis[strs[j]] = 1;
                }
            }
        
            for(int i = 0; i < n; i ++) 
                if(vis[strs[i]] == 0) maxx = max(maxx, (int)strs[i].length());
            
            return maxx;
        }
        
        bool issame(string a, string b) {
            int j = 0;
            int la = a.length(), lb = b.length();
            for(int  i = 0; i < la; i ++)
                if(a[i] == b[j]) j ++;
    
            if(j >= lb) return true;
            return false;
        }
    };
    
  • 相关阅读:
    Spring国际化模块
    广告牌 循环 轮播 图片
    ImageLoader 网络加载图片
    ProgressBar 进度条 旋转
    UI处理 线程
    权限 动态 访问
    系统 状态栏 导航栏
    对话框 dialog 整理
    修改 字体
    获取 Activity中所有的View ViewGroup
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10815745.html
Copyright © 2011-2022 走看看