qiyuangong/leetcode

Python & JAVA Solutions for Leetcode

leetcode's Issues

Wrong answer in Problem Q7 and Test case code in "__main__"

Hi, I just check a code for Q7. Reverse Integer and it gives wrong answer in the test case.

So, Can I make some changes in this code?

And, In old codes there are some test case code in main.
Can I update this code by erasing?

Add new function

Hello, I watched that there is a short explanation of various problems through readme.
In this regard, it would be better if repository users could distinguish the problem by algorithm.
Therefore, I would like to add the problem classification according to the algorithm to readme.
Is it okay to add this classification function?

removeNthFromEnd

if len(linklist)<n there is error

Python

009_Palindrome_Number.py in python 3

I tried to run this code in python 3, and the result is not correct.
since the default number structure is float in python 3, I changed the code as bellow:
`class Solution(object):
def isPalindrome(self, x):
if x < 0:
return False
ls = len(str(x))
tmp = x
print((int(ls/2)))
for i in range(int(ls/2)):
right = int(tmp % 10)
left = tmp / (10 ** (ls - 2 * i - 1))
left = int(left % 10)
print (left, right)
if left != right:
return False
tmp = tmp // 10
return True

if name == 'main':
# begin
s = Solution()
print (s.isPalindrome(10000100001))`

Thank you.

Add a new repo in Other leetcode solutions link.

Could you please also add my LeetCode solutions repo in the other leetcode section.

Have a look at it over here: leetcode-algorithms

It contains solutions in java and python and also video descriptions of the algorithm.

Code was wrong :(

It's shows wrong answer
Wrong Answer
Runtime: 36 ms

Advance python

`TypeError` in Q12 Integer to Roman

TypeError: 'float' object cannot be interpreted as an integer

leetcode/python/012_Integer_to_Roman.py

Line 38 in 0564594

for j in range(k):

Add Bitwise solution for Python 007_Reverse_Integer.py

Hi, I noticed that the current solution for 007_Reverse_Integer.py is using string. I am wondering if it is possible that we also add a bitwise method (basically checking if the last bit is 1, and shift the binary string << 1 every time), which could be more proper here. I can add this method if that is ok.

Leetcode solution

Upgrade to Python3

[ ] Upgrade from Python 2 to Python3

LeetCode 146 wrong answer

I have tried the solution of Leetcode 146, and it shows wrong answer?

New Problem

I have this problem can you solve this. If you can please tell me the pseudocode or algorithm, please.

add the question itself in the code

I believe including question itself as comment in the solution code will be good...