Skip to content

Instantly share code, notes, and snippets.

Avatar

Lee Seongjoo lseongjoo

  • CodeBasic
  • Seoul, Korea
View GitHub Profile
@lseongjoo
lseongjoo / graph.py
Last active Dec 13, 2015
A simple graph data structure
View graph.py
#!/usr/bin/env python
import itertools
class Graph(dict):
def __init__(self, vs=[], es=[]):
"""create a new graph. (vs) is a list of vertices;
(es) is a list of edges."""
for v in vs:
self.add_vertex(v)
View MainActivity.java
public class MainActivity extends android.support.v4.app.FragmentActivity {
// Only one MapView instance is allowed per MapActivity,
// so we inflate it in the MainActivity and tie its
// lifetime here to the MainActivity. Package scope
// so we can grab them from different instances of map
// fragments.
//
// The other option was to make them static, but that causes
// memory leaks on screen rotation.
View mMapViewContainer;
View multiArray.cpp
// ERROR!
void printArray(int arr[][])
{
for(int i=0; i<2; i++)
for(int j=0; j<3; j++)
cout << a[i][j] << " ";
cout << endl;
}
View TimeUtil.java
import java.sql.Timestamp;
import java.text.SimpleDateFormat;
import java.util.Date;
import java.util.Locale;
public class TimeUtil {
public static Timestamp getTimestamp(){
Timestamp timestamp = new Timestamp(System.currentTimeMillis());
return timestamp;
}
View gist:4655679
int i;
for(i=1; i<=10; i++);
{
std::cout << i << " ";
}
@lseongjoo
lseongjoo / fibonacci.cpp
Last active Dec 11, 2015
Fibonacci sequence generator
View fibonacci.cpp
// n번째 피보나치 수열 반환
// n = 0, 1, 2, ...
int fibonacci(int nth)
{
int n1 = 0;
int n2 = 1;
int n3;
// F_0 = 0 , F_1 = 1
if(nth == 0 || nth == 1)
@lseongjoo
lseongjoo / gist:4616705
Last active Dec 11, 2015
C++ post increment usage
View gist:4616705
int sum_elements(int[] array, int numOfElements)
{
int sum = 0;
int index = 0;
while(index < numOfElements)
sum += array[index++];
return sum;
}