backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-06-14 22:27:45 +08:00
Code Issues Projects Releases Wiki Activity

remove un-necessary typecast & use uint64_t

Browse Source
This commit is contained in:
Krishna Vedala
2020-05-28 15:59:28 -04:00
parent 2412f95964
commit e12a5d4b5d
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
math/string_fibonacci.cpp
View File

@@ -28,18 +28,18 @@ std::string add(std::string a, std::string b) {
int carry = 0; int carry = 0;
// fills up with zeros // fills up with zeros
while ((int)a.length() < (int)b.length()) { while (a.length() < b.length()) {
a = "0" + a; a = "0" + a;
} }
// fills up with zeros // fills up with zeros
while ((int)b.length() < (int)a.length()) { while (b.length() < a.length()) {
b = "0" + b; b = "0" + b;
} }
// adds the numbers a and b // adds the numbers a and b
for (int i = a.length() - 1; i >= 0; i--) { for (int i = a.length() - 1; i >= 0; i--) {
char val = (char)(((a[i] - 48) + (b[i] - 48)) + 48 + carry); char val = static_cast<char>(((a[i] - 48) + (b[i] - 48)) + 48 + carry);
if (val > 57) { if (val > 57) {
carry = 1; carry = 1;
val -= 10; val -= 10;
@@ -65,11 +65,11 @@ std::string add(std::string a, std::string b) {
/** Fibonacci iterator /** Fibonacci iterator
* \param [in] n n^th Fibonacci number * \param [in] n n^th Fibonacci number
*/ */
void fib_Accurate(long long n) { void fib_Accurate(uint64_t n) {
std::string tmp = ""; std::string tmp = "";
std::string fibMinus1 = "1"; std::string fibMinus1 = "1";
std::string fibMinus2 = "0"; std::string fibMinus2 = "0";
for (long long i = 0; i < n; i++) { for (uint64_t i = 0; i < n; i++) {
tmp = add(fibMinus1, fibMinus2); tmp = add(fibMinus1, fibMinus2);
fibMinus2 = fibMinus1; fibMinus2 = fibMinus1;
fibMinus1 = tmp; fibMinus1 = tmp;