Advertisement
Guest User

Untitled

a guest
Apr 24th, 2017
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.32 KB | None | 0 0
  1. public int? this[int start, int end]
  2. {
  3. get
  4. {
  5. Node tmp = head;
  6. int sum = 0;
  7. int begin = 0;
  8. while (tmp != null && end >= begin)
  9. {
  10. if (begin++ >= start)
  11. sum += (int)tmp.data;
  12. tmp = tmp.next;
  13. }
  14. return sum;
  15. }
  16. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement