Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 58e0fb0

Browse files
Update normal
Update normal
1 parent 630058d commit 58e0fb0

12 files changed

+12
-12
lines changed

‎Python3/001_Two_Sum.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33
'''
44
Given an array of integers, find two numbers such that they add up to a specific target number.

‎Python3/002_Add_Two_Numbers.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33
'''
44
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

‎Python3/003_Longest_Substring_Without_Repeating_Characters.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33
'''
44
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

‎Python3/004_Median_of_Two_Sorted_Arrays.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33
'''
44
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

‎Python3/007_Reverse_Integer.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33
'''
44
Reverse digits of an integer.

‎Python3/009_Palindrome_Number.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33
'''
44
Determine whether an integer is a palindrome. Do this without extra space.

‎Python3/011_Container_With_Most_Water.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33

44

‎Python3/012_Integer_to_Roman.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33
'''
44
Given an integer, convert it to a roman numeral.

‎Python3/013_Roman_to_Integer.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33
'''
44
Given a roman numeral, convert it to an integer.

‎Python3/014_Longest_Common_Prefix.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
#!usr/bin/env python
1+
#!usr/bin/env python3
22
# -*- coding:utf-8 -*-
33

44

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /