LeetCode: 面试题 01.01. 判定字符是否唯一
easy 题 >> 太有学问了
正常思路 >> 遍历位运算 >> 这才是题目想考的知识吧
遍历
public boolean isUnique(String astr
) {
for (int i
= 0; i
< astr
.length(); i
++) {
if(astr
.indexOf(astr
.charAt(i
)) != astr
.lastIndexOf(astr
.charAt(i
))) return false;
}
return true;
}
位运算
还要继续理解
public boolean isUnique(String astr
) {
int mark
= 0;
for (int i
= 0; i
< astr
.length(); i
++) {
int moveLen
= astr
.charAt(i
) - 'a';
if((mark
& (1 << moveLen
)) != 0) return false;
else mark
|= (1 << moveLen
);
}
return true;
}
>> 解题思思路
转载请注明原文地址: https://lol.8miu.com/read-25381.html