algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-07 17:56:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Create Atoi Function.java (#3756)

Browse Source 
* Create MyAtoi.java

There is a method in C++, which converts String to an Integer, called Atoi function, this is my own implementation of this function.

* Update directory

* Update MyAtoi.java

* Create MyAtoiTest.java

* Update directory

* Update directory

* Update directory

* Update MyAtoi.java

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Debasish Biswas <debasishbsws.abc@gmail.com>
This commit is contained in:
Aidar Djamalbek
2022-11-01 17:04:14 +06:00
committed by GitHub
parent d418bbd1cf
commit fea982d54d
3 changed files with 235 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

88
src/main/java/com/thealgorithms/strings/MyAtoi.java Normal file
View File

@ -0,0 +1,88 @@
// Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi function). Here is my implementation
package com.thealgorithms.strings;
public class MyAtoi {
public static int myAtoi(String s) {
s = s.trim();
char[] char_1 = s.toCharArray();
String number = "";
boolean negative = false;
boolean zero = false;
boolean isDigit = false;
for (char ch : char_1) {
if (Character.isDigit(ch)) {
if (number.length() > 1 && !isDigit) {
number = "0";
break;
}
isDigit = true;
if (zero) {
number = "0";
break;
}
switch (ch) {
case '0' -> number += ch;
case '1' -> number += ch;
case '2' -> number += ch;
case '3' -> number += ch;
case '4' -> number += ch;
case '5' -> number += ch;
case '6' -> number += ch;
case '7' -> number += ch;
case '8' -> number += ch;
case '9' -> number += ch;
}
} else if (ch == '-' && !isDigit) {
number += "0";
negative = true;
} else if (ch == '+' && !isDigit) {
number += "0";
} else if (ch == '.' && isDigit) {
break;
} else if (ch == '.') {
zero = true;
} else {
if (!isDigit) {
number = "0";
}
break;
}
}
if (!isDigit) {
return 0;
}
number = number.replaceFirst("^0+(?!$)", "");
if (number.length() > 10 && negative) {
return -2147483648;
} else if (number.length() > 10) {
return 2147483647;
} else if (number.length() == 10 && negative) {
double db1 = Double.parseDouble(number);
if (db1 >= 2147483648d) {
return -2147483648;
}
} else if (number.length() == 10) {
double db1 = Double.parseDouble(number);
if (db1 > (2147483647)) {
return 2147483647;
}
}else if (number.length() == 10 && negative) {
double db1 = Double.parseDouble(number);
if (db1 >= 2147483648d) {
return -2147483648;
}
}
if(negative){
return Integer.parseInt(number)*-1;
}
return Integer.parseInt(number);
}
}