leetcode_Longest Common Prefix_easy
来源:互联网 发布:大数据应用发展趋势 编辑:程序博客网 时间:2024/06/06 12:51
Write a function to find the longest common prefix string amongst an array of strings.
直接进行扫描即可。
class Solution {public: string longestCommonPrefix(vector<string> &strs) { int findFlag=0,pos=0,minLen=INT_MAX; string res; if(strs.size()==0) return res; //求最短的那个串的长度 for(vector<string>::iterator iter=strs.begin(); iter!=strs.end(); iter++) { if((*iter).size()<minLen) minLen=(*iter).size(); } //纵向一个字母一个字母扫描 while(!findFlag && pos<minLen)//每次循环遍历了所有字符串的某个pos的字母 { vector<string>::iterator iter=strs.begin(); char tmp=(*iter)[pos]; for(; iter!=strs.end(); iter++)//对所有字符串上的pos位置进行遍历 { if(tmp!=(*iter)[pos]) { findFlag=1; break; } } if(findFlag==0) res.push_back(tmp); pos++;//while循环,pos后移1个 } return res; }};
0 0
- leetcode_Longest Common Prefix_easy
- Leetcode_longest-common-prefix
- Leetcode_Longest Common Prefix
- LeetCode_Longest Common Prefix
- leetcode_Longest Common Prefix
- leetcode_Longest Common Prefix
- leetcode_Longest Consecutive Sequence
- Leetcode_longest-consecutive-sequence
- leetcode_Longest Palindromic Substring
- Leetcode_Longest Palindromic Substring
- LeetCode_Longest Consecutive Sequence
- LeetCode_Longest Palindromic Substring
- LeetCode_Longest Valid Parentheses
- LeetCode_Longest Palindromic Substring
- leetcode_Longest Increasing Subsequence
- leetCode_Longest Valid Parentheses
- leetCode_Longest Consecutive Sequence
- Leetcode_Longest Substring Without Repeating Characters
- 关于c# TCP SOCKET 通信
- 在openstack neutron中使用VxLAN
- linux下阅读源代码的工具
- MTD原始设备与FLASH硬件驱动的对话
- Linux显示机器的处理器架构
- leetcode_Longest Common Prefix_easy
- Java虚拟机使用引用计数来确定对象是否存活?
- 奇怪的Javascript(持续更新)
- bzoj2223: [Coci 2009]PATULJCI 主席树
- openssl 非对称加密DSA,RSA区别与使用介绍(转)
- 9、Palindrome Number
- centos中添加DNS,添加网关等命令小结
- ASCII码对应表chr(9)、chr(10)、chr(13)、chr(32)、chr(34)、chr(39)、chr(..
- openstack网络模式之vlan分析