First Position Unique Character

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
样例
Given s = "lintcode", return 0.

Given s = "lovelintcode", return 2.

import java.util.Scanner;

/**
 * Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
样例
Given s = "lintcode", return 0.
Given s = "lovelintcode", return 2.
 * 
 * @author Dell
 *
 */
public class Test646 {
  public static int firstUniqChar(String s)
  {
	     if(s.equals(""))
	     {
	    	 return 0;
	     }
	  int[] chr=new int[256];
	  for(int i=0;i<s.length();i++)
	  {
		 chr[s.charAt(i)]++;
	  }
	 for(int i=0;i<s.length();i++)
	 {
		 if(chr[s.charAt(i)]==1)
		 {
			 return i;
		 }
	 }
	 return -1;
  }
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		String s=sc.next();
		System.out.println(firstUniqChar(s));
	}

}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值