cracking the code interview problem 1.1

最新推荐文章于 2024-10-06 20:29:51 发布

yundomo

最新推荐文章于 2024-10-06 20:29:51 发布

阅读量815

点赞数

分类专栏： cracking the code interview 文章标签： java 面试 algorithm

本文链接：https://blog.csdn.net/yiding_he/article/details/19459513

版权

cracking the code interview 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

public class Solution {
	public static boolean isUnique(String str){
		if(str.length()>256)
			return false;
		boolean[] visited = new boolean[256];
		for(int i=0;i<str.length();i++){
			int val = str.charAt(i);
			if(visited[val])
				return false;
			visited[val] = true;
		}
		return true;
	}
	public static void main(String[] args) {
		String[] words = {"abcde", "hello", "apple", "kite", "padle"};
		for (String word : words) {
			System.out.println(word + ": " + isUnique(word));
		}
	}
}

Implement an algorithm to determine if a string has all unique characters. What if you can not use additional data structures?

Ask: Could you please tell me how large the character set is? Is it only 26 letters? Or is it ASCII? Or much more?