Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7026019
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T00:03:43+00:00 2026-05-28T00:03:43+00:00

String[] tokens = s.split(‘ ‘); for(int i = 0; i < (tokens.length) – 1;

  • 0
String[] tokens = s.split(' ');
    for(int i = 0; i < (tokens.length) - 1; ++i)
    {  
            if(isDigit(tokens[i]))
        {
            // Two numbers cannot be together without an operator.
            if(isDigit(tokens[i + 1]))
            {
                check = 1;
                break;
            }
            if((tokens[i + 1] == '(') )
            {
                check = 1;
                break;
            }
        }
           }

s is the string i’m splitting. after splitting i want to check whether each split part is a digit. i m not able to use isDigit because it can only be used on characters and here the split part is String.

NOTE: i m writing a program for a calculator. if i use toCharArray() the more than one digit numbers will be split. eg. 23 will become 2 and 3 seperately.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-28T00:03:44+00:00Added an answer on May 28, 2026 at 12:03 am
    int isDigit = false;
    try
    {
        Integer.parseInt(tokens[i])
        isDigit = true;
    }
    catch(NumberFormatException e)
    {
    
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have writed this piece of code in java: String[] tokens = strLine.split(delims); SimpleOrderRequest
I'm using re.split() to separate a string into tokens. Currently the pattern I'm using
I'm trying to split a string into tokens (via regular expressions) in the following
How do you split a string e.g. a:b:c:d into tokens for parsing in Perl?
I have a string of richtext characters/tokens that I would like to feed to
Say I have a string. Then I have a number of unique tokens or
I'm using preg_replace_callback to substitute particular tokens within the string. But apart from actual
consider the following two pieces of code: public static Time Parse(string value) { string
Possible Duplicates: How to split a string in C++? Splitting a C++ std::string using
It seems to have modified the original string that I wanted to split specifying

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.